|
|
A243081型 |
| 将n个组分的数量A(n,k)分成重数不大于k的部分;方阵A(n,k),n>=0,k>=0。 |
|
21
|
|
|
1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 3, 0, 1, 1, 2, 3, 3, 0, 1, 1, 2, 4, 7, 5, 0, 1, 1, 2, 4, 7, 11, 11, 0, 1, 1, 2, 4, 8, 15, 21, 13, 0, 1, 1, 2, 4, 8, 15, 26, 34, 19, 0, 1, 1, 2, 4, 8, 16, 31, 52, 59, 27, 0, 1, 1, 2, 4, 8, 16, 31, 57, 93, 114, 57, 0, 1, 1, 2, 4, 8, 16, 32, 63, 114, 173, 178, 65, 0
(列表;桌子;图表;参考;听;历史;文本;内部格式)
|
|
|
抵消
|
0, 13
|
|
评论
|
A(n,k)是n避开模式{1}^(k+1)的组合数。
|
|
链接
|
|
|
配方奶粉
|
|
|
例子
|
方阵A(n,k)开始:
1, 1, 1, 1, 1, 1, 1, 1, 1, ...
0, 1, 1, 1, 1, 1, 1, 1, 1, ...
0, 1, 2, 2, 2, 2, 2, 2, 2, ...
0, 3, 3, 4, 4, 4, 4, 4, 4, ...
0, 3, 7, 7, 8, 8, 8, 8, 8, ...
0, 5, 11, 15, 15, 16, 16, 16, 16, ...
0, 11, 21, 26, 31, 31, 32, 32, 32, ...
0, 13, 34, 52, 57, 63, 63, 64, 64, ...
0, 19, 59, 93, 114, 120, 127, 127, 128, ...
|
|
MAPLE公司
|
b: =proc(n,i,p,k)选项记忆`如果`(n=0,p!,`if`(i<1,0,
添加(b(n-i*j,i-1,p+j,k)/j!,j=0..分钟(n/i,k))
结束时间:
A: =(n,k)->`if`(k>=n,`if`)(n=0,1,2^(n-1)),b(n$2,0,k)):
seq(seq(A(n,d-n),n=0..d),d=0..14);
|
|
数学
|
b[n_,i_,p_,k_]:=b[n,i,p,k]=如果[n==0,p!,如果[i<1,0,
求和[b[n-i*j,i-1,p+j,k]/j!,{j,0,最小值[n/i,k]}]];
A[n_,k_]:=如果[k>=n,如果[n==0,1,2^(n-1)],b[n,n,0,k]];
|
|
交叉参考
|
k=0-10列给出:A000007号,A032020型,A232432型,A232464型,A243082型,A243083型,A243084型,A243085型,A243086型,A243087型,A243088型.
|
|
关键词
|
|
|
作者
|
|
|
状态
|
经核准的
|
|
|
|