|
|
A152936号 |
| 围绕行和设计的向量递归A000165号:v(n)=如果[奇数,{1.n,n^2,…,2^n*n!-和2^m,{m,0,n/2-1}],2^n*n-和2^m,{m,0,n/2-1}],。。。n^2.n,1},{1.n,n^2,…,2^n*n!-2Sum2^m,{m,0,n/2-1}],。。。n^2.n,1}]。 |
|
0
|
|
|
1, 1, 1, 1, 6, 1, 1, 23, 23, 1, 1, 4, 374, 4, 1, 1, 5, 1914, 1914, 5, 1, 1, 6, 36, 45994, 36, 6, 1, 1, 7, 49, 322503, 322503, 49, 7, 1, 1, 8, 64, 512, 10320750, 512, 64, 8, 1, 1, 9, 81, 729, 92896460, 92896460, 729, 81, 9, 1, 1, 10, 100, 1000, 10000, 3715868978, 10000
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
0,5
|
|
评论
|
行总和为:
{1, 2, 8, 48, 384, 3840, 46080, 645120, 10321920, 185794560, 3715891200,...}
|
|
链接
|
|
|
配方奶粉
|
v(n)=如果[奇数,{1.n,n^2,…,2^n*n!-和2^m,{m,0,n/2-1}],2^n*n-和2^m,{m,0,n/2-1}],。。。n^2.n,1},
{1.n,n^2,…,2^n*n!-2Sum2^m,{m,0,n/2-1}],。。。n^2.n,1}]。
|
|
例子
|
{1},
{1, 1},
{1, 6, 1},
{1, 23, 23, 1},
{1, 4, 374, 4, 1},
{1, 5, 1914, 1914, 5, 1},
{1, 6, 36, 45994, 36, 6, 1},
{1, 7, 49, 322503, 322503, 49, 7, 1},
{1, 8, 64, 512, 10320750, 512, 64, 8, 1},
{1, 9, 81, 729, 92896460, 92896460, 729, 81, 9, 1},
{1, 10, 100, 1000, 10000, 3715868978, 10000, 1000, 100, 10, 1}
|
|
数学
|
清除[v,n];v[0]={1};v[1]={1,1};v[n_]:=v[n]=如果[Mod[n,2]==0,连接[Table[n^m,{m,0,Floor[n/2]-1}],{2^n*n!-2*Sum[n^ m,{m,0,Floor[n/2]-1}]},Table[n ^m,},Floor[1,0,-1}]],
连接[Table[n^m,{m,0,Floor[n/2]-1}],{2^n*n!/2-总和[n^n,{m、0,Floor[n/2]-1}]/2-总和[n^m,{m,0,Floor[n/2]-1}]},表[n^ m,{m,Floor[2]-1,0,-1}]]'
表[v[n],{n,0,10}];
压扁[%]
|
|
交叉参考
|
|
|
关键字
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|