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

 


A210052型
T(n,k)=包含所有值0..2的(n+1)X(k+1)0..2数组的数量,每个2X2子块有两个不同的值,新值0..2按行主顺序引入
9
0, 9, 9, 75, 119, 75, 475, 1271, 1271, 475, 2695, 12377, 20871, 12377, 2695, 14443, 114237, 332891, 332891, 114237, 14443, 74831, 1020363, 5169813, 8989701, 5169813, 1020363, 74831, 379459, 8917959, 78792305, 240224641, 240224641, 78792305
抵消
1,2
评论
表格开始
......0........9..........75...........475.............2695..............14443
......9......119........1271.........12377...........114237............1020363
.....75.....1271.......20871........332891..........5169813...........78792305
....475....12377......332891.......8989701........240224641.........6356262535
...2695...114237.....5169813.....240224641......11175987745.......518401340537
..14443..1020363....78792305....6356262535.....518401340537.....42412428208163
..74831..8917959..1184416509..166752843125...23937024685863...3466529466974219
.379459.76781969.17624469579.4344981788295.1100584205159383.282766248564198397
链接
例子
n=4k=3的一些解
..0..0..0..0....0..1..1..0....0..0..1..2....0..0..0..0....0..1..0..0
..0..1..0..2....1..0..1..0....0..1..1..2....0..1..0..1....0..0..0..1
..0..1..0..2....0..1..0..1....0..0..1..1....0..0..1..1....2..2..0..1
..1..0..0..2....0..0..1..0....2..0..0..1....1..0..0..0....2..0..0..0
..1..0..2..0....2..0..1..0....0..2..0..1....0..1..0..2....2..2..2..2
关键字
非n,
作者
R.H.哈丁2012年3月16日
状态
经核准的

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

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

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