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

 


A267952型
T(n,k)=nXk 0..2数组的数量,每行和每列中的每个重复值比之前的重复值大一个mod 3,左上角元素为零。
7
1, 3, 3, 8, 27, 8, 21, 192, 192, 21, 53, 1323, 3250, 1323, 53, 132, 8427, 52542, 52542, 8427, 132, 323, 52272, 755896, 1965330, 755896, 52272, 323, 783, 312987, 10458126, 63015581, 63015581, 10458126, 312987, 783, 1880, 1839267, 137349742, 1919539785
抵消
1,2
评论
表格开始
....1........3............8.............21..............53..............132
....3.......27..........192...........1323............8427............52272
....8......192.........3250..........52542..........755896.........10458126
...21.....1323........52542........1965330........63015581.......1919539785
...53.....8427.......755896.......63015581......4342251846.....280943128130
..132....52272.....10458126.....1919539785....280943128130...38163253126664
..323...312987....137349742....54600088140..16705109186509.4689944257913744
..783..1839267...1754573922..1497422284157.949536358874750
.1880.10603200..21788175316.39564274878078
.4485.60345675.265455230994
链接
配方奶粉
k列的经验值:
k=1:a(n)=3*a(n-1)+a(n-2)-6*a(n-3)
k=2:a(n)=10*a(n-1)-8*a
例子
n=3k=4的一些解
..0..1..2..2....0..2..1..0....0..2..1..2....0..1..2..2....0..0..1..2
..1..2..0..1....2..1..0..0....0..1..0..2....2..2..0..2....1..0..0..2
..2..1..2..0....2..1..1..2....2..0..0..1....0..0..1..0....2..2..1..0
关键字
非n,
作者
R.H.哈丁2016年1月22日
状态
经核准的

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

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

上次修改时间:2024年9月21日14:48 EDT。包含376087个序列。(在oeis4上运行。)