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

 


搜索: a207107-编号:a207197
    排序:关联|参考文献||被改进的|创建     格式:长的|短的|数据
T(n,k)=水平方向上避免0 0 0和1 0 1,垂直方向上避免了0 0 1和1 1 0的nXk 0..1数组的数量
+10
10
2, 4, 4, 6, 16, 6, 9, 36, 36, 8, 13, 81, 98, 64, 10, 19, 169, 271, 200, 100, 12, 28, 361, 665, 643, 350, 144, 14, 41, 784, 1675, 1759, 1271, 556, 196, 16, 60, 1681, 4344, 4939, 3773, 2239, 826, 256, 18, 88, 3600, 11081, 14446, 11497, 7093, 3641, 1168, 324, 20, 129
抵消
1,1
评论
表格开始
..2...4....6....9....13....19.....28......41......60.......88......129
..4..16...36...81...169...361....784....1681....3600.....7744....16641
..6..36...98..271...665..1675...4344...11081...28136....71908...183709
..8..64..200..643..1759..4939..14446...41505..118266...339548...975493
.10.100..350.1271..3773.11497..36868..116117..361408..1134028..3564401
.12.144..556.2239..7093.23091..79802..271023..906448..3057442.10340359
.14.196..826.3641.12169.41893.154228..558557.1985288..7118528.25615229
.16.256.1168.5581.19515.70537.274288.1050811.3937294.14887794.56536529
链接
配方奶粉
k列的经验值:
k=1:a(n)=2*n
k=2:a(n)=4*n^2
k=3:a(n)=(4/3)*n^3+8*n^2-(10/3)*n
k=4:a(n)=(5/12)*n^4+(13/2)*n*3+(115/12)*n|2-(17/2)*n+1
k=5:a(n)=(8/3)*n^4+(49/3)*n*3+(16/3)*n ^2-(43/3)*n+3
k=6:a(n)=(4/15)*n^5+(45/4)*n*4+(199/6)*n ^3-(73/4)*n ^2-(373/30)*n+5
k=7:a(n)=(187/60)*n^5+(153/4)*n*4+(455/12)*n|3-(249/4)*n~2+(209/30)*n+4
例子
n=4k=3的一些解
..1..1..1....0..1..0....1..1..0....0..0..1....1..1..0....0..1..0....1..0..0
..1..1..1....1..1..0....0..0..1....0..0..1....1..0..0....0..1..0....0..0..1
..1..1..1....0..1..0....1..1..1....0..0..1....1..0..0....0..1..0....1..0..0
..1..1..1....1..1..0....1..1..1....0..0..1....1..0..0....0..1..0....0..0..1
交叉参考
第2列为A016742号
第3列为2006年2月
第4列是A207107型
第1行是A000930号(n+3)
第2行是A207170型
关键词
非n,
作者
R.H.哈丁2012年2月16日
状态
经核准的
T(n,k)=水平避免0 0 1和0 1 0以及垂直避免0 0 1和1 1 0的nXk 0..1阵列的数量
+10
10
2, 4, 4, 6, 16, 6, 9, 36, 36, 8, 14, 81, 98, 64, 10, 21, 196, 271, 200, 100, 12, 31, 441, 834, 643, 350, 144, 14, 46, 961, 2307, 2356, 1271, 556, 196, 16, 68, 2116, 6115, 7561, 5348, 2239, 826, 256, 18, 100, 4624, 16544, 23071, 19319, 10570, 3641, 1168, 324, 20, 147
抵消
1,1
评论
表格开始
..2...4....6....9....14.....21.....31......46.......68......100.......147
..4..16...36...81...196....441....961....2116.....4624....10000.....21609
..6..36...98..271...834...2307...6115...16544....44250...116526....307117
..8..64..200..643..2356...7561..23071...72410...223804...678174...2060069
.10.100..350.1271..5348..19319..65955..232892...806886..2731598...9282799
.12.144..556.2239.10570..42167.158217..616386..2348280..8718366..32527713
.14.196..826.3641.18972..82477.335915.1424240..5887228.23664574..95673277
.16.256.1168.5581.31710.148743.651531.2975974.13215696.56972122.247183399
链接
配方奶粉
k列的经验值:
k=1:a(n)=2*n
k=2:a(n)=4*n^2
k=3:a(n)=(4/3)*n^3+8*n^2-(10/3)*n
k=4:a(n)=(5/12)*n^4+(13/2)*n*3+(115/12)*n|2-(17/2)*n+1
k=5:a(n)=(2/15)*n^5+(55/12)*n_4+(101/6)*n_3+(5/12)*n ^2-(299/30)*n+2
k=6:a(n)=(1/36)*n^6+(113/60)*n*5+(151/9)*n_4+(95/4)*n ^3-(605/36)*n(229/30)*n+3
k=7:a(n)=(1/210)*n^7+(103/180)*n^6+(197/20)*n^5+(1439/36)*n^4+(293/20)*n^3-(3469/90)*n^2+(157/105)*n+3
例子
n=4k=3的一些解
..1..0..0....0..0..0....0..1..1....1..1..1....1..1..1....1..0..1....1..0..1
..0..0..0....0..1..1....1..1..0....1..1..1....1..0..1....1..0..1....0..1..1
..1..0..0....0..1..1....1..1..1....1..1..1....1..1..1....1..0..1....0..1..1
..0..0..0....0..1..1....1..1..1....1..1..1....1..1..1....1..0..1....0..1..1
交叉参考
第1列为A004275号(n+1)
第2列为A016742号
第3列为2006年2月
第4列是A207107型
第1行是A038718号(n+2)
第2行是A207069型
关键词
非n,
作者
R.H.哈丁2012年2月17日
状态
经核准的
T(n,k)=水平避免0 0 1和1 0 0以及垂直避免0 0 1和1 1 0的nXk 0..1阵列的数量
+10
10
2, 4, 4, 6, 16, 6, 9, 36, 36, 8, 14, 81, 98, 64, 10, 22, 196, 271, 200, 100, 12, 35, 484, 844, 643, 350, 144, 14, 56, 1225, 2706, 2422, 1271, 556, 196, 16, 90, 3136, 8977, 9430, 5594, 2239, 826, 256, 18, 145, 8100, 30168, 38207, 25490, 11256, 3641, 1168, 324, 20, 234
抵消
1,1
评论
表格开始
..2...4....6....9....14.....22......35.......56.......90.......145........234
..4..16...36...81...196....484....1225.....3136.....8100.....21025......54756
..6..36...98..271...844...2706....8977....30168...102384....349069....1193648
..8..64..200..643..2422...9430...38207...156792...649758...2703377...11276024
.10.100..350.1271..5594..25490..121313...584386..2841676..13864995...67793828
.12.144..556.2239.11256..58602..319439..1760946..9794226..54631117..305277128
.14.196..826.3641.20568.120276..737575..4570122.28555126.178852957.1121957980
.16.256.1168.5581.34986.226850.1544037.10609482.73474400.509887759.3543126698
链接
例子
n=4k=3的一些解
..0..1..0....1..1..0....0..0..0....1..1..0....1..1..1....0..1..1....0..0..0
..1..1..1....1..1..0....0..0..0....0..0..0....1..0..1....1..1..0....0..1..1
..0..1..1....1..1..0....0..0..0....0..1..0....1..1..1....1..1..1....0..1..0
..0..1..1....1..1..0....0..0..0....0..1..0....1..1..1....1..1..1....0..1..1
交叉参考
第1列为A004275号(n+1)
第2列为A016742号
第3列为2006年2月
第4列是A207107型
第1行是2016年11月(n+2)
第2行是A207436型
关键词
非n,
作者
R.H.哈丁2012年2月21日
状态
经核准的

搜索在0.006秒内完成

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

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

上次修改时间:美国东部夏令时2024年9月20日03:37。包含376016个序列。(在oeis4上运行。)