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

 


A196863号
T(n,k)=nXk 0..4个数组的数量,每个元素x等于其水平和垂直邻域的数量,等于3,4,2,0,1,对于x=0,1,2,3,4
7
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 7, 4, 1, 1, 6, 12, 12, 6, 1, 1, 9, 26, 35, 26, 9, 1, 1, 13, 56, 102, 102, 56, 13, 1, 1, 19, 113, 281, 473, 281, 113, 19, 1, 1, 28, 235, 787, 1900, 1900, 787, 235, 28, 1, 1, 41, 490, 2237, 7428, 11280, 7428, 2237, 490, 41, 1, 1, 60, 1012, 6346
抵消
1,5
评论
每0紧挨着0 3,每1紧挨着1 4,每2紧挨着2 2,每3紧挨着3 0,每4紧挨着4 1
表格开始
.1..1....1.....1......1........1.........1..........1............1
.1..2....3.....4......6........9........13.........19...........28
.1..3....7....12.....26.......56.......113........235..........490
.1..4...12....35....102......281.......787.......2237.........6346
.1..6...26...102....473.....1900......7428......29859.......120761
.1..9...56...281...1900....11280.....62298.....350779......1995082
.1.13..113...787...7428....62298....494579....3938849.....31419870
.1.19..235..2237..29859...350779...3938849...44461736....500005832
.1.28..490..6346.120761..1995082..31419870..500005832...7927841482
.1.41.1012.17976.488123.11350977.250968250.5615771466.125246087887
链接
例子
n=6 k=4的一些解
..0..2..2..2....0..0..0..0....0..0..0..0....0..2..2..0....0..0..0..0
..0..2..0..2....0..0..2..2....0..2..2..2....0..2..2..0....2..2..2..2
..2..2..0..2....0..0..2..2....2..2..0..2....0..0..0..0....2..0..0..2
..2..0..0..2....2..2..0..0....2..0..0..2....0..0..0..0....2..0..0..2
..2..2..0..2....2..2..0..0....2..0..2..2....0..2..2..0....2..0..0..2
..0..2..2..2....0..0..0..0....2..2..2..0....0..2..2..0....2..2..2..2
关键字
非n,
作者
R.H.哈丁2011年10月6日
状态
经核准的

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

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

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