OEIS哀悼西蒙斯感谢西蒙斯基金会支持包括OEIS在内的许多科学分支的研究。
登录
OEIS由OEIS基金会的许多慷慨捐赠者.

 

标志
提示
(来自的问候整数序列在线百科全书!)
A201533型 行和列按字典顺序不减少且每个元素至少等于一个水平或垂直邻居的n X 2 0..2数组的数量。 1
3, 9, 25, 69, 175, 410, 899, 1859, 3649, 6840, 12311, 21378, 35964, 58819, 93800, 146222, 223292, 334639, 492954, 714755, 1021293, 1439616, 2003809, 2756429, 3750155, 5049674, 6733825, 8898024, 11656994, 15147825, 19533390, 25006144 (列表;图表;参考;;历史;文本;内部格式)
抵消
1,1
评论
第2列,共2列A201539号.
链接
配方奶粉
经验:a(n)=(1/40320)*n^8-(1/3360)*n*7+(23/2880)*n|6-(1/48)*n_5+(247/5760)*n ^4+(231/160)*n^3-(6777/1120)*n_2+(3121/168)*n-20表示n>3。
推测来自科林·巴克2018年5月23日:(开始)
总尺寸:x*(3-18*x+52*x^2-84*x^3+76*x^4-25*x^5-19*x^6+20*x^7+x^8-9*x^9+5*x^10-x^11)/(1-x)^9。
当n>12时,a(n)=9*a(n-1)-36*a(n-2)+84*a(n3)-126*a。
(结束)
例子
n=10的一些解决方案:
..0..2....0..2....0..1....0..0....0..1....0..2....0..0....0..0....0..1....0..1
..0..2....0..2....0..1....0..1....0..1....0..2....0..0....0..1....0..1....0..1
..0..2....0..2....1..1....1..1....0..1....2..0....0..0....0..1....0..1....0..1
..0..2....0..2....1..2....1..1....0..1....2..0....0..2....0..2....1..0....0..1
..0..2....0..2....1..2....1..2....1..0....2..0....1..2....0..2....1..0....1..0
..1..1....1..0....1..2....1..2....1..0....2..0....1..2....0..2....1..0....1..0
..1...1...1...0...1...2...2...1...0...2...2...2...2...0...2...1...1...2...2...2...2...2...2...2...2...2...2...2...2...2...2
..1..2....2..0....2..0....2..1....2..1....2..2....2..2....2..1....2..1....2..2
..1..2....2..0....2..0....2..2....2..1....2..2....2..2....2..1....2..2....2..2
..1..2....2..2....2..2....2..2....2..2....2..2....2..2....2..1....2..2....2..2
交叉参考
囊性纤维变性。A201539号.
关键词
非n
作者
R.H.哈丁2011年12月2日
状态
经核准的

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

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

上次修改时间:美国东部夏令时2024年5月29日00:29。包含372921个序列。(在oeis4上运行。)