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

 


A199256号
T(n,k)=以行主顺序引入值为0..3的nXk 0..3数组的数量,每个值的实例数彼此之间的数量,并且没有等于任何水平或垂直相邻的元素
8
1, 1, 1, 1, 1, 1, 1, 14, 14, 1, 6, 21, 114, 21, 6, 21, 424, 447, 447, 424, 21, 41, 571, 16898, 11223, 16898, 571, 41, 36, 14160, 311216, 305863, 305863, 311216, 14160, 36, 281, 18157, 2913528, 8862785, 68639138, 8862785, 2913528, 18157, 281, 1051, 508802
抵消
1,8
评论
表格开始
....1......1...........1............1.............6..............21
....1......1..........14...........21...........424.............571
....1.....14.........114..........447.........16898..........311216
....1.....21.........447........11223........305863.........8862785
....6....424.......16898.......305863......68639138......6888550898
...21....571......311216......8862785....6888550898....208100267703
...41..14160.....2913528....267827143..340245592285.186725016600685
...36..18157....11312517...8351549833.6769314291049
..281.508802...551973865.266729329121
.1051.635901.11307744507
链接
例子
n=6 k=4的一些解
..0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1
..1..0..2..3....1..0..2..0....1..2..1..2....1..2..1..3....1..2..1..2
..3..2..1..2....3..2..3..2....0..3..2..3....3..0..3..2....2..3..2..3
..2..0..3..0....2..3..1..3....2..1..3..0....2..3..2..3....0..2..0..2
..3..2..1..3....3..2..3..0....0..3..0..3....0..2..3..1....3..0..3..1
..2..1..3..0....1..0..1..2....1..2..3..2....1..0..2..0....1..3..0..3
关键词
非n,
作者
R.H.哈丁2011年11月4日
状态
经核准的

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

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

上次修改时间:2024年9月22日08:59 EDT。包含376097个序列。(在oeis4上运行。)