@[xiaduowen](/user/147595)
```cpp
up(1,100,n){
dn(n,1,i) A[n-i+1]=i; B[0]=1;
up(1,n,i){
B[i]=B[i-1]; while(B[i]*A[i]<B[i-1]*A[i-1]) ++B[i];
}
up(1,n,i) printf("%d ",B[i]); puts("");
}
```
我觉得这个代码应该没有问题吧……
by 离散小波变换° @ 2020-03-26 12:30:33
$\rm OEIS$提到了一个公式：
$$a(n+1) = 1 + [..[[[[n*3/2]5/4]7/6]9/8]...(2k+1)/2k]...]$$
然而不知道怎么优化……
by 离散小波变换° @ 2020-03-26 12:31:31
```plain
1,3,5,9,11,17,21,29,33,41,47,57,59,77,81,101,107,117,131,149,153,173,191,209,213,239,257,273,281,321,329,359,371,401,417,441,453,497,509,539,569,611,621,647,671,717,731,779,801,839,869,917,929,989,1001,1053,1067,1121,1173,1199,1211,1277,1331,1391,1401,1427,1487,1547,1557,1631,1661,1713,1769,1833,1847,1881,1931,2039,2057,2117,2159,2241,2291,2313,2339,2433,2493,2579,2601,2661,2717,2759,2817,2921,2939,3053,3071,3101,3233,3281
```
这……找不出规律.jpg
by WYXkk @ 2020-03-26 12:31:53
@[离散小波变换°](/user/68344) 没看到严格单调增，我跪了（
by 离散小波变换° @ 2020-03-26 12:33:12
http://oeis.org/A007952
by WYXkk @ 2020-03-26 12:33:19
那看来应该是这个序列了：
<https://oeis.org/A007952>
by 离散小波变换° @ 2020-03-26 12:34:53
~~我是英语菜鸡，嘤嘤嘤~~
by Dancing_Wave @ 2020-03-26 12:36:25
@[离散小波变换°](/user/68344) 为什么这个好像埃筛呀
by 离散小波变换° @ 2020-03-26 12:38:25
~~奇妙.jpg~~
by Dancing_Wave @ 2020-03-26 12:38:38