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

 


A252433型
T(n,k)=每个3X3子块行和对角线和等于0 2 4 6或7,每个3 X3列和反对角线总和不等于0 2 46或7的(n+2)X(k+2)0..3数组的数目
16
641, 915, 602, 1142, 688, 608, 1693, 1033, 914, 878, 2710, 1488, 1810, 1801, 1152, 4342, 3057, 2971, 3954, 2993, 1603, 6941, 6178, 8430, 7575, 9643, 6164, 2617, 12295, 10309, 20632, 26396, 20187, 24024, 13139, 4131, 20379, 24196, 38186, 74892, 85563
抵消
1,1
评论
表格开始
...641....915...1142....1693.....2710......4342......6941......12295
...602....688...1033....1488.....3057......6178.....10309......24196
...608....914...1810....2971.....8430.....20632.....38186.....110958
...878...1801...3954....7575....26396.....74892....151863.....530739
..1152...2993...9643...20187....85563....302218....652210....2786331
..1603...6164..24024...53028...284379...1190037...2718502...14673858
..2617..13139..59977..139425...920196...4567070..10924203...71981082
..4131..26670.153283..374789..3034712..18926855..47376966..384953455
..6514..55677.389066..987296.10150190..75297774.196667998.2025948930
.11116.119785.994207.2598603.32981888.295100889.788158275.9974109278
链接
配方奶粉
k列的经验值:
k=1:n>34时[线性递归27阶]
k=2:[阶数33],对于n>37
k=3:[订单48]对于n>51
k=4:对于n>74,[订单72]
k=5:对于n>101,[顺序99]
第n行的经验值:
n=1:n>44时[第29阶线性递归]
n=2:[订单27],对于n>34
n=3:[订单30],对于n>34
n=4:对于n>46,[订单39]
n=5:对于n>58,[顺序54]
n=6:对于n>67,[订单60]
n=7:对于n>97,[订单90]
例子
n=4k=4的一些解
..3..2..2..3..2..2....2..3..2..2..0..0....2..2..3..2..2..3....2..3..2..2..0..2
..2..3..2..2..3..2....2..2..3..2..2..0....1..3..0..1..3..3....2..2..0..2..2..3
..3..0..1..3..0..1....1..0..3..1..3..3....2..3..2..2..3..2....1..3..3..1..3..3
..3..2..2..3..2..2....2..3..2..2..3..2....2..2..3..2..2..3....2..3..2..2..3..2
..2..3..2..2..3..2....2..2..0..2..2..3....1..3..3..1..3..3....2..2..3..2..2..3
..3..0..1..3..3..1....1..3..3..1..3..3....2..0..2..2..0..2....1..0..3..1..3..0
关键词
非n,
作者
R.H.哈丁2014年12月17日
状态
经核准的

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

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

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