搜索： a237234-编号：a237243
|
| |
|
|
A237227号
|
| （n+1）X（1+1）0..2个数组的数量，每个2 X 2子块的最大值加上最小值与其水平和垂直相邻块相差正好一。 |
|
+10
1
|
|
|
|
81, 268, 928, 2784, 9628, 28912, 100008, 300256, 1038560, 3118208, 10785696, 32383104, 112011072, 336303872, 1163253760, 3492571136, 12080581376, 36270926848, 125458829824, 376679553024, 1302910621696, 3911879237632
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：对于n>7，a（n）=8*a（n-2）+24*a（n-4）+8*a（n-6）。
经验公式：x*（81+268*x+280*x^2+640*x^3+260*x^4+208*x^5+64*x^6）/（（1+2*x^2）*（1-10*x^2-4*x*4））-科林·巴克，2018年10月21日
|
|
|
例子
|
n=5的一些解决方案：
..2..1....1..2....0..2....1..0....0..2....2..1....2..0....1..0....2..1....2..1
..0..0....0..0....1..0....2..1....0..0....2..2....0..1....1..0....1..0....0..0
..1..0....1..0....0..1....1..1....1..0....0..1....0..0....2..1....1..1....1..0
..2..2....2..2....2..2....1..1....1..2....0..1....2..2....1..2....1..1....2..2
..1..1....1..2....1..1....2..2....1..1....1..2....1..2....0..1....0..0....1..2
..0..2....1..0....1..1....0..0....0..2....2..1....2..0....0..1....0..2....0..0
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
A237228号
|
| （n+1）X（2+1）0..2个数组的数量，每个2 X 2子块的最大值加上最小值与其水平和垂直相邻块相差正好一。 |
|
+10
1
|
|
|
|
268, 984, 3284, 10888, 36180, 120540, 401520, 1336540, 4448892, 14811704, 49313092, 164172108, 546554288, 1819586828, 6057775468, 20167512408, 67141506132, 223527096380, 744165226864, 2477470556540, 8247979825436
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：对于n>8，a（n）=a（n-1）+4*a（n-2）+5*a（n-3）+21*a（-n4）+12*a（n5）+4*a（n-6）。
经验公式：4*x*（67+179*x+307*x^2+582*x^3+402*x^4+127*x^5-6*x^6-8*x^7）/（1-x-4*x^2-5*x^3-21*x^4-12*x^5-4*x^6）-科林·巴克，2018年10月21日
|
|
|
例子
|
n=5的一些解决方案：
..0..0..0....1..0..1....2..2..1....1..2..1....1..1..0....2..0..1....0..2..1
..0..1..2....1..1..2....0..1..2....2..1..0....1..2..2....1..0..0....0..1..1
..2..2..1....1..1..2....0..1..0....0..0..0....0..1..2....0..1..2....0..1..1
..2..1..0....1..0..0....2..1..1....1..1..2....0..0..0....1..2..1....2..2..1
..1..0..1....2..1..1....2..1..1....1..1..2....0..0..1....1..1..0....1..1..0
..1..0..2....1..1..1....0..0..1....0..1..0....0..1..2....1..1..0....1..1..1
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
A237229型
|
| （n+1）X（3+1）0..2数组的数量，每个2X2子块的最大值加上最小值与其水平和垂直相邻块相差正好一 |
|
+10
1
|
|
|
|
928, 3284, 12014, 29456, 97862, 269844, 926086, 2450048, 8256930, 22301740, 75579798, 202641416, 684983946, 1842571444, 6234175914, 16748300216, 56643845034, 152257571812, 515024932506, 1384075694696, 4681456782942
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：当n>13时，a（n）=5*a（n-2）+42*a（n-4）-21*a（n6）-207*a（-n8）
|
|
|
例子
|
n=5的一些解
..0..2..2..2....1..0..2..2....1..1..2..0....0..1..2..2....2..0..0..2
..0..1..2..2....0..1..2..1....1..1..1..1....2..2..1..0....1..1..1..1
..0..0..1..1....2..2..1..0....2..1..1..0....1..1..0..0....2..1..1..0
..2..1..1..1....2..1..0..0....0..1..2..2....1..1..0..0....0..0..1..2
..1..1..1..0....1..0..1..2....0..0..1..2....2..2..1..0....0..1..2..1
..2..0..1..2....0..1..2..2....2..1..0..1....0..1..1..2....2..2..2..0
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
237230英镑
|
| （n+1）X（4+1）0..2数组的数量，每个2X2子块的最大值加上最小值与其水平和垂直相邻块相差正好一 |
|
+10
1
|
|
|
|
2784, 10888, 29456, 83436, 233536, 671080, 1919288, 5542856, 15833748, 45309424, 129364012, 371396844, 1063000280, 3048786056, 8719902452, 24994666460, 71536549320, 205067864500, 587032939664, 1682282732208, 4816175986888
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：对于n>16，a（n）=4*a（n-2）+3*a（n-3）+24*a
|
|
|
例子
|
n=4的一些解
..2..0..0..1..2....1..2..2..0..1....1..1..2..2..2....0..2..2..0..1
..1..1..1..2..2....0..1..1..0..1....0..0..1..1..0....1..1..2..1..0
..2..1..1..2..2....0..1..1..1..2....2..1..1..1..0....1..0..1..2..2
..1..0..0..1..1....1..2..1..1..2....2..1..1..2..1....2..1..0..1..2
..1..0..0..0..2....2..2..0..0..0....2..0..0..1..1....1..2..0..0..0
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
A237231型
|
| （n+1）X（5+1）0..2阵列的数量，每个2X2子块的最大值加上最小值与其水平和垂直相邻块相差正好一 |
|
+10
1
|
|
|
|
9628, 36180, 97862, 233536, 721854, 1737372, 5299502, 12992080, 40059070, 97555340, 300177654, 731229928, 2240228750, 5478702380, 16794581906, 41072728888, 125888770174, 307837473900, 942852920590, 2306978778432
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验公式：a（n）=7*a（n-2）+10*a（n-4）+15*a（n6）-314*a（8-8）-1389*a（a-10）+1365*a（-12）+3415*a
|
|
|
例子
|
n=3的一些解
..1..2..1..1..2..0....2..1..0..0..2..2....1..2..2..0..0..2....1..0..1..2..0..1
..0..1..1..1..2..2....1..2..1..0..1..1....0..1..2..1..1..2....0..1..2..1..1..1
..1..1..1..0..1..2....0..1..2..1..1..1....1..0..1..1..1..2....2..1..1..0..1..1
..1..1..2..1..0..1....1..0..2..2..0..0....2..1..0..2..2..0....2..1..1..0..2..1
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
A237232型
|
| （n+1）X（6+1）0..2个数组的数量，每个2 X 2子块的最大值加上最小值与其水平和垂直相邻块相差正好一。 |
|
+10
1
|
|
|
|
28912, 120540, 269844, 671080, 1737372, 5016852, 13078228, 34663620, 93075252, 252437984, 674728104, 1815877108, 4898412064, 13182357508, 35265033144, 95378791936, 256131894912, 690260009684, 1852770334916, 5004415058468
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：a（n）=4*a（n-2）+24*a 8（n-20）+448608（n-21）+574916（n-22）+20728（n-23）+1436288（n-24）+23184（n-25）+245120（n-26）+187872*a（n-27）+671424*a（n-28）+16128*a。
|
|
|
例子
|
n=2的一些解
..0..2..1..0..1..2..1....1..0..2..1..0..0..2....2..1..0..1..2..1..1
..0..1..2..1..0..1..2....0..1..2..2..1..1..0....0..0..1..2..1..0..0
..0..0..1..2..0..1..0....0..2..2..2..2..0..0....1..1..2..1..0..0..2
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
A237233号
|
| （n+1）X（7+1）0..2个阵列的数量，其中每个2X2子块的最大值加最小值与其水平和垂直邻居相差恰好一 |
|
+10
1
|
|
|
|
100008, 401520, 926086, 1919288, 5299502, 13078228, 42143930, 92484308, 270710424, 638608676, 1940008986, 4500620876, 13454873260, 31731133484, 95618929690, 223781988876, 667596360496, 1582932137332, 4750121115990
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
配方奶粉
|
经验：a（n）=5*a（n-2）+26*a（n-4）-26*a 797384（n-32）-438054576（n-34）+1413159680（n-36）+3841915520（n-38）-400228160（n-40）对于n>63，-851565568*a（n-42）-1236199808*a（n-44）-2446382592*a（a-46）+1411232256*a（b-48）+27648000*a
|
|
|
例子
|
n=1的一些解
..2..2..1..1..2..1..0..2....0..0..2..1..0..0..1..1....1..0..2..2..0..1..1..1
..0..2..1..1..2..0..0..1....0..1..1..2..0..1..2..1....0..0..1..2..1..0..2..1
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
|
| |
|
|
A237226号
|
| （n+1）X（n+1）0..2个阵列的数量，其中每个2X2子块的最大值加最小值与其水平和垂直相邻块相差恰好一。 |
|
+10
0
|
|
|
|
81, 984, 12014, 83436, 721854, 5016852, 42143930, 257895268, 2084528746, 12713615332, 102302637674, 609602834160, 4861186951014, 29162489418784, 231673032285662, 1389160154318372
(列表;图表;参考;听;历史;文本;内部格式)
|
|
|
|
抵消
|
1,1
|
|
|
评论
|
|
|
|
链接
|
|
|
|
例子
|
n=4的一些解
..1..0..2..1..2....1..0..2..2..1....0..0..2..2..0....1..1..2..1..0
..1..1..2..1..0....0..0..1..1..0....0..1..1..2..2....1..0..1..2..2
..1..1..1..0..1....0..0..1..1..1....2..1..0..1..2....2..1..0..1..1
..2..1..1..1..2....0..1..2..1..1....1..2..1..1..0....2..2..1..1..1
..2..0..0..2..2....0..2..1..0..1....0..1..1..1..0....0..2..2..0..0
|
|
|
交叉参考
|
|
|
|
关键词
|
非n
|
|
|
作者
|
|
|
|
状态
|
经核准的
|
| |
|
搜索在0.005秒内完成
|
