登录
OEIS由OEIS基金会的许多慷慨捐赠者.

 

标志
提示
(来自的问候整数序列在线百科全书!)
A256816型 T(n,k)=长度n+k 0..1阵列的数量,每k个连续相邻对中最多有两个下行。 10
4, 8, 8, 16, 16, 16, 32, 32, 32, 32, 63, 64, 64, 64, 64, 120, 124, 128, 128, 128, 128, 219, 229, 245, 256, 256, 256, 256, 382, 402, 442, 484, 512, 512, 512, 512, 638, 673, 753, 856, 956, 1024, 1024, 1024, 1024, 1024, 1080, 1220, 1424, 1656, 1888, 2048, 2048, 2048 (列表;桌子;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
表格开始
....4....8...16....32....63...120...219...382....638...1024...1586...2380
....8...16...32....64...124...229...402...673...1080...1670...2500...3638
...16...32...64...128...245...442...753..1220...1894...2836...4118...5824
...32...64..128...256...484...856..1424..2249...3402...4965...7032...9710
...64..128..256...512...956..1656..2693..4158...6153...8792..12202..16524
..128..256..512..1024..1888..3204..5088..7677..11120..15579..21230..28264
..256..512.1024..2048..3728..6192..9613.14168..20075..27566..36888..48304
..512.1024.2048..4096..7362.11955.18104.26117..36218..48738..64024..82440
.1024.2048.4096..8192.14539.23088.34013.47858..65130..86008.110976.140536
.2048.4096.8192.16384.28712.44617.63928.87338.116104.150906.191620.238932
链接
配方奶粉
k列的经验值:
k=1:a(n)=2*a(n-1)
k=2:a(n)=2*a(n-1)
k=3:a(n)=2*a(n-1)
k=4:a(n)=2*a(n-1)
k=5:a(n)=2*a(n-1)-a(n-2)+2*a(n-3)-a
k=6:a(n)=2*a(n-1)-a(n-2)+2*a(n-3)-a(n-4)+3*a(n-6)-2*a(n-7)-6*a(n-9)+4*a(n-10)
k=7:[顺序15]
第n行的经验值:
n=1:a(n)=(1/120)*n^5+(1/8)*n|3+(1/2)*n*2+(41/30)*n+2
n=2:a(n)=(1/120)*n^5+(1/24)*n^4+(3/8)*n^3-(1/24)*n^2+(277/60)*n+3
n=3:a(n)=(1/120)*n^5+(1/12)*n*4+(31/24)*n|3-(31/12)*n~2+(66/5)*n+4
n=4:对于n>2,[五次多项式]
n=5:[5次多项式]对于n>3
n=6:对于n>4,[五次多项式]
n=7:对于n>5,[五次多项式]
例子
n=4,k=4的一些解
..1....1....0....0....0....0....1....0....0....0....0....0....1....0....0....1
..0....0....1....1....0....1....0....1....1....0....0....0....1....0....0....1
..1....1....0....1....0....0....1....0....1....1....1....1....0....1....0....1
..0....1....1....1....0....1....1....1....1....1....0....0....1....1....0....0
..0....1....0....0....1....1....1....1....0....0....1....1....1....1....0....0
..0....1....1....0....1....1....0....0....0....1....0....0....0....1....0....1
..0....0....1....0....1....1....1....0....0....1....1....1....0....0....0....0
..0....1....0....1....1....1....0....1....0....1....0....1....0....1....0....1
交叉参考
第1列是A000079号(n+1)。
第2列为A000079号(n+2)。
第3列为A000079号(n+3)。
第4列是A000079号(n+4)。
第1行是A006261号(n+1)。
关键词
非n,
作者
R.H.哈丁2015年4月10日
状态
经核准的

查找|欢迎光临|维基|注册|音乐|地块2|演示|索引|浏览|更多|网络摄像头
贡献新序列。或评论|格式|样式表|转换|超级搜索|最近
OEIS社区|维护人OEIS基金会。

许可协议、使用条款、隐私政策。.

上次修改时间:美国东部夏令时2024年6月21日21:50。包含373559个序列。(在oeis4上运行。)