|
|
A171145号 |
| 多项式递归的系数序列:p(x,n)=如果[Mod[n,2]==0,(x+1)*p(x、n-1),(x^2+n*x+1)^Floor[n/2]]。 |
|
0
|
|
|
1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 10, 27, 10, 1, 1, 11, 37, 37, 11, 1, 1, 21, 150, 385, 150, 21, 1, 1, 22, 171, 535, 535, 171, 22, 1, 1, 36, 490, 3024, 7539, 3024, 490, 36, 1, 1, 37, 526, 3514, 10563, 10563, 3514, 526, 37, 1, 1, 55, 1215, 13530, 76845, 188001, 76845
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
1,5
|
|
评论
|
行总和为:
{1, 2, 5, 10, 49, 98, 729, 1458, 14641, 29282, 371293, 742586,...}.
其模2似乎是交错的Sierpinski型分形。
|
|
链接
|
|
|
配方奶粉
|
p(x,n)=如果[Mod[n,2]==0,(x+1)*p(x、n-1),(x^2+n*x+1)^楼层[n/2]]
|
|
例子
|
{1},
{1, 1},
{1, 3, 1},
{1, 4, 4, 1},
{1, 10, 27, 10, 1},
{1, 11, 37, 37, 11, 1},
{1, 21, 150, 385, 150, 21, 1},
{1, 22, 171, 535, 535, 171, 22, 1},
{1, 36, 490, 3024, 7539, 3024, 490, 36, 1},
{1, 37, 526, 3514, 10563, 10563, 3514, 526, 37, 1},
{1, 55, 1215, 13530, 76845, 188001, 76845, 13530, 1215, 55, 1},
{1, 56, 1270, 14745, 90375, 264846, 264846, 90375, 14745, 1270, 56, 1}
|
|
数学
|
清除[p,n,x,a]
p[x,1]:=1;
p[x_,n_]:=p[x,n]=如果[Mod[n,2]==0,(x+1)*p[x,n-1],(x^2+n*x+1)^楼层[n/2]];
a=表[系数列表[p[x,n],x],{n,1,12}];
压扁[a]
|
|
交叉参考
|
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|