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

 

标志
提示
(来自的问候整数序列在线百科全书!)
A192713号 每行求和为零的12X2整数矩阵的数量,行元素按非递减顺序排列,行按字典顺序排列,元素的平方和<=2*n^2(总模平方不超过2*n^ 2的12个零和2-向量的集合数量,忽略向量和分量排列) 1
2, 6, 19, 53, 133, 310, 669, 1371, 2684, 5037, 9125, 16021, 27343, 45523, 74103, 118121, 184828, 284258, 430192, 641623, 944008, 1371445, 1968786, 2795325, 3927604, 5465114, 7534219, 10297413, 13958709, 18775675, 25067921, 33235421 (列表;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
第(12,2,n)列A192710型
链接
例子
12X2<=2*4^2的一些解决方案
.-2..2...-2..2...-2..2...-1..1...-2..2...-2..2...-1..1....0..0...-2..2...-1..1
.-1..1...-1..1...-1..1...-1..1...-1..1...-2..2...-1..1....0..0...-1..1...-1..1
.1-1…-1-1…-1-1…-1-1…-1-1…-1-1…-2-2…-1-1…..0…-1-1…..0
.-1..1...-1..1...-1..1...-1..1...-1..1....0..0...-1..1....0..0...-1..1....0..0
..0..0...-1..1...-1..1...-1..1...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0...-1..1...-1..1...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0...-1..1...-1..1...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0...-1..1...-1..1...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0...-1..1....0..0...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0...-1..1....0..0...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0....0..0....0..0...-1..1....0..0....0..0....0..0...-1..1....0..0
..0..0....0..0....0..0....0..0....0..0....0..0....0..0....0..0...-1..1....0..0
交叉参考
关键词
非n
作者
R.H.哈丁2011年7月7日
状态
经核准的

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

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

最后修改时间:美国东部时间2024年5月3日06:44。包含372206个序列。(在oeis4上运行。)