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

 


A239537号
T(n,k)=(n+1)X(k+1)0..2数组的个数,其中没有元素等于所有水平邻域或不等于所有垂直邻域,并且新值0..2按行主顺序引入
13
1, 2, 1, 6, 2, 6, 16, 6, 24, 13, 44, 16, 216, 68, 47, 120, 44, 1536, 1014, 406, 128, 328, 120, 11616, 11108, 13254, 1584, 405, 896, 328, 86400, 131988, 293741, 98304, 7790, 1181, 2448, 896, 645504, 1533792, 7199001, 3785280, 984150, 33630, 3598, 6688, 2448
抵消
1,2
评论
表格开始
.....1......2.........6...........16..............44...............120
.....1......2.........6...........16..............44...............120
.....6.....24.......216.........1536...........11616.............86400
....13.....68......1014........11108..........131988...........1533792
....47....406.....13254.......293741.........7199001.........171712936
...128...1584.....98304......3785280.......165336096........6976042240
...405...7790....984150.....71388971......5988724293......482858009716
..1181..33630...8368566...1093269814....169350916116....25030781490504
..3598.156032..77673624..18727824939...5466853947751..1514104924173186
.10705.695344.687582150.301846514891.164296850179323.84271877225127052
链接
配方奶粉
k列的经验值:
k=1:a(n)=2*a(n-1)+4*a(n-2)-3*a(n-3)
k=2:[顺序10]
k=3:a(n)=8*a(n-1)+26*a(n-2)-166*a
第n行的经验值:
n=1:a(n)=2*a(n-1)+2*a(n-2)
n=2:a(n)=2*a(n-1)+2*a(n-2)
n=3:a(n)=6*a(n-1)+12*a(n-2)-8*a(n-3)
n=4:[顺序10]
n=5:[订单37]
n=6:[订单85]
例子
n=4k=4的一些解
..0..1..0..0..1....0..1..2..1..2....0..1..1..2..1....0..1..2..0..2
..0..1..0..0..1....0..1..2..1..2....0..1..1..2..1....0..1..2..0..2
..0..2..0..2..1....1..2..2..1..2....0..1..1..0..1....0..1..2..0..2
..0..2..0..2..1....1..2..2..1..0....2..0..2..0..2....1..0..2..1..2
..0..2..0..2..1....1..2..2..1..0....2..0..2..0..2....1..0..2..1..2
交叉参考
关键词
非n,
作者
R.H.哈丁2014年3月21日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年9月22日11:40。包含376114个序列。(在oeis4上运行。)