|
Search: id:A066448
|
|
|
| A066448 |
|
Triangle T(n,k) giving number of basic partitions of n with a Durfee square of order k (n >= 0, 0 <= k <= n). |
|
+0
2
|
|
| 1, 0, 1, 0, 2, 0, 0, 2, 0, 0, 0, 2, 1, 0, 0, 0, 2, 2, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 2, 6, 0, 0, 0, 0, 0, 0, 2, 8, 0, 0, 0, 0, 0, 0, 0, 2, 10, 1, 0, 0, 0, 0, 0, 0, 0, 2, 12, 2, 0, 0, 0, 0, 0, 0, 0, 0, 2, 14, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 16, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 18, 12, 0, 0, 0, 0, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
LINKS
|
J. M. Nolan, C. D. Savage and H. S. Wilf, Basis partitions, Discrete Math. 179 (1998), 277-283.
|
|
EXAMPLE
|
1; 0,1; 0,2,0; 0,2,0,0; 0,2,1,0,0; ...
|
|
MAPLE
|
T := proc(n, d); option remember; if n=0 and d=0 then RETURN(1) elif n<=0 or d<=0 then RETURN(0) else RETURN(T(n-d, d)+T(n-2*d+1, d-1)+T(n-3*d+1, d-1)) fi:
|
|
PROGRAM
|
(PARI) T(n, k)=if(k<0|k>n, 0, if(k==0, n==0, T(n-k, k)+T(n-2*k+1, k-1)+T(n-3*k+1, k-1))) - Michael Somos Mar 10 2004
|
|
CROSSREFS
|
Sequence in context: A112301 A134013 A136521 this_sequence A108497 A108498 A130209
Adjacent sequences: A066445 A066446 A066447 this_sequence A066449 A066450 A066451
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 29 2001
|
|
|
Search completed in 0.002 seconds
|
