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

 

标志
提示
(来自的问候整数序列在线百科全书!)
A199237号 T(n,k)=按行主顺序引入值为0..2的nXk 0..2数组的数量,每个值的实例数在彼此之间,每个元素至少等于一个水平或垂直邻居 7
0, 0, 0, 0, 0, 0, 0, 3, 3, 0, 0, 12, 10, 12, 0, 1, 31, 134, 134, 31, 1, 3, 143, 1162, 7772, 1162, 143, 3, 3, 1183, 14159, 233185, 233185, 14159, 1183, 3, 1, 5068, 157598, 2350573, 16467051, 2350573, 157598, 5068, 1, 6, 11594, 1893418, 198168342, 410003607 (列表;桌子;图表;参考;;历史;文本;内部格式)
抵消
1,8
评论
表格开始
.0......0........0..........0...........0...........1...........3.............3
.0......0........3.........12..........31.........143........1183..........5068
.0......3.......10........134........1162.......14159......157598.......1893418
.0.....12......134.......7772......233185.....2350573...198168342....5945464970
.0.....31.....1162.....233185....16467051...410003607.88764401434.6694765030353
.1....143....14159....2350573...410003607.74737706829
.3...1183...157598..198168342.88764401434
.3...5068..1893418.5945464970
1.11594.22549653
.6.133430
链接
例子
n=6 k=4的一些解
..0..1..0..0....0..0..0..0....0..1..0..0....0..0..0..0....0..0..0..0
..0..1..0..0....0..0..1..1....0..1..2..0....0..0..1..2....0..1..2..2
..1.2.2.2.2.2...1.2.2.2.2.2.2.2.2.2.2.2.1.2.2...0.1.1.2...0.1.2.2
..1..2..2..2....1..2..2..2....0..1..1..2....0..0..1..2....2..2..1..0
..2..2..0..0....0..2..1..2....0..0..1..1....2..1..1..2....2..2..1..0
..1..1..1..1....0..1..1..2....1..1..2..2....2..1..1..1....2..1..1..1
交叉参考
关键词
非n,
作者
R.H.哈丁2011年11月4日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年4月16日18:22。包含371750个序列。(在oeis4上运行。)