搜索: a241864-编号:a241864
|
|
A238342型
|
| 按行读取的三角形T(n,k):T(n,k)是n的组成数,最小部分正好出现k次,n>=0,0<=k<=n。 |
|
+10 17
|
|
|
1, 0, 1, 0, 1, 1, 0, 3, 0, 1, 0, 3, 4, 0, 1, 0, 8, 3, 4, 0, 1, 0, 11, 10, 5, 5, 0, 1, 0, 20, 18, 14, 5, 6, 0, 1, 0, 34, 35, 24, 21, 6, 7, 0, 1, 0, 59, 60, 59, 35, 27, 7, 8, 0, 1, 0, 96, 121, 108, 85, 49, 35, 8, 9, 0, 1, 0, 167, 217, 213, 175, 125, 63, 44, 9, 10, 0, 1, 0, 282, 391, 419, 366, 258, 176, 80, 54, 10, 11, 0, 1
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
0,8
|
|
评论
|
猜想:一般来说,对于k>0,是a(n)~n^k*((1+sqrt(5))/2)^(n-2*k-1)/(5^((k+1)/2)*k!)。保持所有k≤10-瓦茨拉夫·科特索维奇2014年5月2日
|
|
链接
|
|
|
例子
|
三角形开始:
00: 1;
01: 0, 1;
02:0,1,1;
03: 0, 3, 0, 1;
04: 0, 3, 4, 0, 1;
05: 0, 8, 3, 4, 0, 1;
06: 0, 11, 10, 5, 5, 0, 1;
07: 0, 20, 18, 14, 5, 6, 0, 1;
08: 0, 34, 35, 24, 21, 6, 7, 0, 1;
09: 0, 59, 60, 59, 35, 27, 7, 8, 0, 1;
10: 0, 96, 121, 108, 85, 49, 35, 8, 9, 0, 1;
11: 0, 167, 217, 213, 175, 125, 63, 44, 9, 10, 0, 1;
12: 0, 282, 391, 419, 366, 258, 176, 80, 54, 10, 11, 0, 1;
13: 0, 475, 709, 808, 730, 579, 371, 236, 99, 65, 11, 12, 0, 1;
14:08001281521521481221202861513309120,77,12,13,0,1;
15: 0, 1352, 2283, 2872, 2925, 2512, 1862, 1238, 684, 395, 143, 90, 13, 14, 0, 1;
...
|
|
枫木
|
b: =proc(n,s)选项记忆`如果`(n=0,1,
`如果`(n<s,0,展开(加(b(n-j,s)*x,j=s..n))
结束时间:
T: =(n,k)->`如果`(k=0,`如果'(n=0,1,0),加((p->add(coeff(p,x,i))*
二项式(i+k,k),i=0..度(p))(b(n-j*k,j+1),j=1..n/k)):
seq(seq(T(n,k),k=0..n),n=0..15);
|
|
数学
|
b[n_,s_]:=b[n,s]=如果[n==0,1,如果[n<s,0,展开[Sum[b[n-j,s]*x,{j,s,n}]]];T[n_,k_]:=If[k==0,If[n==0,1,0],Sum[函数[{p},Sum[系数[p,x,i]*二项式[i+k,k],{i,0,指数[p,x]}]][b[n-j*k,j+1]],{j,1,n/k}]];表[表[T[n,k],{k,0,n}],{n,0,15}]//展平(*Jean-François Alcover公司2014年11月7日,翻译自枫叶*)
|
|
交叉参考
|
k=0-10列给出:A000007号,A105039标准,A241862型,A241863型,A241864型,241865美元,A241866型,A241867号,A241868型,A241869型,A241870型.
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
搜索在0.022秒内完成
|