|
Search: id:A096144
|
|
|
| A096144 |
|
Triangle T(n,k) = number of partitions of n in which the least part occurs exactly k times, k=1..n. |
|
+0
1
|
|
| 1, 1, 1, 2, 0, 1, 2, 2, 0, 1, 4, 1, 1, 0, 1, 4, 3, 2, 1, 0, 1, 7, 3, 2, 1, 1, 0, 1, 8, 6, 2, 3, 1, 1, 0, 1, 12, 5, 6, 2, 2, 1, 1, 0, 1, 14, 11, 5, 4, 3, 2, 1, 1, 0, 1, 21, 11, 8, 5, 4, 2, 2, 1, 1, 0, 1, 24, 17, 11, 9, 4, 5, 2, 2, 1, 1, 0, 1, 34, 20, 15, 9, 8, 4, 4, 2, 2, 1, 1, 0, 1, 41, 30, 18, 14, 9, 7, 5
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
FORMULA
|
G.f. for k-th column: Sum(x^(k*m)/Product(1-x^i, i=m+1..infinity), m=1..infinity).
|
|
EXAMPLE
|
1; 1,1; 2,0,1; 2,2,0,1; 4,1,1,0,1; 4,3,2,1,0,1; 7,3,2,1,1,0,1; ....
|
|
CROSSREFS
|
Cf. A002865(first column), A096373(second column), A000041(row sums).
Sequence in context: A133121 A091602 A035465 this_sequence A118401 A113678 A110249
Adjacent sequences: A096141 A096142 A096143 this_sequence A096145 A096146 A096147
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 24 2004
|
|
|
Search completed in 0.002 seconds
|
