|
Search: id:A105147
|
|
|
| A105147 |
|
Triangular array read by rows: T(n,k) = number of compositions of n having smallest part equal to k. |
|
+0
3
|
|
| 1, 1, 1, 3, 0, 1, 6, 1, 0, 1, 13, 2, 0, 0, 1, 27, 3, 1, 0, 0, 1, 56, 5, 2, 0, 0, 0, 1, 115, 9, 2, 1, 0, 0, 0, 1, 235, 15, 3, 2, 0, 0, 0, 0, 1, 478, 25, 5, 2, 1, 0, 0, 0, 0, 1, 969, 42, 8, 2, 2, 0, 0, 0, 0, 0, 1, 1959, 70, 12, 3, 2, 1, 0, 0, 0, 0, 0, 1, 3952, 116, 18, 5, 2, 2, 0, 0, 0, 0, 0, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
FORMULA
|
G.f. for k-th column: (1-x)^2*x^k/((1-x-x^k)*(1-x-x^(k+1))).
|
|
EXAMPLE
|
1; 1,1; 3,0,1; 6,1,0,1; 13,2,0,0,1; 27,3,1,0,0,1; 56,5,2,0,0,0,1; ....
|
|
CROSSREFS
|
Cf. A048004.
Sequence in context: A119925 A102765 A129684 this_sequence A111924 A100485 A143397
Adjacent sequences: A105144 A105145 A105146 this_sequence A105148 A105149 A105150
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 10 2005
|
|
|
Search completed in 0.002 seconds
|
