搜索: 编号:a340547
|
|
|
|
1, 1, 2, 1, 2, 4, 1, 2, 3, 8, 1, 2, 4, 4, 16, 1, 2, 4, 8, 6, 32, 1, 2, 3, 8, 16, 8, 64, 1, 2, 3, 4, 13, 32, 11, 128, 1, 2, 4, 4, 6, 16, 64, 12, 256, 1, 2, 2, 8, 5, 8, 26, 128, 16, 512, 1, 2, 4, 8, 16, 6, 11, 32, 256, 22, 1024
(列表;桌子;图表;参考文献;听;历史;文本;内部格式)
|
|
|
抵消
|
1,3
|
|
评论
|
|
|
链接
|
|
|
公式
|
T(2n,…)=2^{0,1,2,…},2^{0,1,…}*第n行,共行A340441.
T(4n+1,…)=2^{0,1,2,…},2^{0,1,…}*第n行,共行A340441.
T(2^n,…)=2^{0,1,2,…}。
|
|
例子
|
第1-8行的八个初始术语如下所示:
1: 1, 2, 4, 8, 16, 32, 64, 128, ...
2: 1, 2, 3, 4, 6, 8, 11, 12, ...
3: 1, 2, 4, 8, 16, 32, 64, 128, ...
4: 1, 2, 4, 8, 13, 16, 26, 32, ...
5: 1, 2, 3, 4, 6, 8, 11, 12, ...
6: 1, 2, 3, 4, 5, 6, 7, 8, ...
7: 1, 2, 4, 8, 16, 32, 64, 128, ...
8: 1, 2, 4, 8, 16, 32, 57, 64, ...
T(3,4)=8,因为:二进制中的(3+1)是100,二进制中的“(3*1)*8=32”是100000,两者都将1位设置为1。
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.004秒内完成
|