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

 


A209951型
T(n,k)=(n+1)X(k+1)0..2数组数量的一半,每个2X2子块最多有一个重复的顺时针边差
9
34, 258, 258, 1956, 4975, 1956, 14832, 95794, 95794, 14832, 112464, 1845126, 4681176, 1845126, 112464, 852768, 35537484, 228881560, 228881560, 35537484, 852768, 6466176, 684469520, 11189540644, 28414622976, 11189540644, 684469520
抵消
1,1
评论
表格开始
.......34..........258.............1956...............14832
......258.........4975............95794.............1845126
.....1956........95794..........4681176...........228881560
....14832......1845126........228881560.........28414622976
...112464.....35537484......11189540644.......3526904366260
...852768....684469520.....547050257224.....437792367422004
..6466176..13183187396...26744766723116...54342179402121844
.49030272.253914272972.1307528820052772.6745399989408922240
链接
例子
n=4k=3的一些解
..2..0..1..2....1..0..0..0....0..0..2..0....1..2..1..1....0..0..2..1
..2..1..1..1....0..2..2..1....0..2..2..2....1..1..1..0....2..0..1..1
..1..1..2..2....0..0..2..0....1..1..0..2....1..2..1..2....0..0..2..0
..2..2..0..1....0..2..1..2....2..0..2..1....0..2..2..2....2..2..1..1
..0..2..2..1....1..1..1..1....1..2..1..1....2..1..0..1....2..1..1..2
关键词
非n,
作者
R.H.哈丁2012年3月16日
状态
经核准的

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

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

上次修改时间:2024年9月23日00:23 EDT。包含376140个序列。(在oeis4上运行。)