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

 


A206635型
T(n,k)=(n+1)X(k+1)0..2个数组的数量,每个2 X 3或3 X 2子块不超过四个等边,并且新值0..2按行主顺序引入。
9
14, 121, 121, 1085, 3232, 1085, 9729, 86392, 86392, 9729, 87238, 2309200, 6885875, 2309200, 87238, 782246, 61723264, 548812835, 548812835, 61723264, 782246, 7014246, 1649819344, 43740991174, 130424683977, 43740991174, 1649819344
抵消
1,1
评论
表格开始时间:
.......14...........121..............1085..................9729
......121..........3232.............86392...............2309200
.....1085.........86392...........6885875.............548812835
.....9729.......2309200.........548812835..........130424683977
....87238......61723264.......43740991174........30995204476194
...782246....1649819344.....3486207195767......7365962082764193
..7014246...44098506880...277854703424333...1750509332449744133
.62895364.1178721971776.22145337882995800.416005797001053603530
链接
例子
n=4,k=3的一些解:
..0..0..0..0....0..0..1..1....0..1..0..1....0..1..0..0....0..1..0..2
..1..0..0..1....1..1..1..0....2..2..1..0....1..1..1..0....1..2..2..1
..2..1..0..0....1..2..1..2....1..1..0..0....2..1..2..2....1..0..1..1
..2..0..0..0....0..1..2..1....2..0..0..0....2..0..2..1....0..0..2..0
..2..0..0..1....2..0..0..1....0..1..1..0....1..1..1..0....0..2..0..0
关键词
非n,
作者
R.H.哈丁2012年2月10日
状态
经核准的

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

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

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