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

 


A222378号
T(n,k)=不超过floor(nXk/2)元素的nXk 0..3个数组的数量不等于至少一个水平或垂直相邻元素,新值以行主元素0..3的顺序引入
7
1, 1, 1, 1, 1, 1, 4, 5, 5, 4, 5, 18, 9, 18, 5, 14, 63, 118, 118, 63, 14, 17, 234, 498, 1391, 498, 234, 17, 75, 1163, 8111, 20340, 20340, 8111, 1163, 75, 95, 4953, 37107, 342953, 271141, 342953, 37107, 4953, 95, 411, 24021, 676485, 6221698, 16985929, 16985929
抵消
1,7
评论
表格开始
....1......1........1..........4...........5..........14..........17
....1......1........5.........18..........63.........234........1163
....1......5........9........118.........498........8111.......37107
....4.....18......118.......1391.......20340......342953.....6221698
....5.....63......498......20340......271141....16985929...286125939
...14....234.....8111.....342953....16985929...963154789.61522684225
...17...1163....37107....6221698...286125939.61522684225
...75...4953...676485..113556454.20743320247
...95..24021..3140167.2103238076
..411.109395.58995438
..519.536457
.2522
链接
例子
n=4k=4的一些解
..0..0..0..0....0..0..0..0....0..0..0..0....0..1..1..1....0..1..2..2
..0..0..0..0....0..0..0..0....1..1..0..0....0..2..1..1....1..1..1..2
..0..0..1..0....0..0..0..0....2..0..0..0....3..1..1..1....1..1..1..1
..2..1..0..0....1..0..2..2....0..0..0..0....1..1..1..1....1..1..1..1
关键词
非n,
作者
R.H.哈丁2013年2月17日
状态
经核准的

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

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

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