|
Search: id:A095133
|
|
|
| A095133 |
|
Triangle of numbers of forests on n nodes containing k trees. |
|
+0
2
|
|
| 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 3, 2, 1, 1, 6, 6, 4, 2, 1, 1, 11, 11, 7, 4, 2, 1, 1, 23, 23, 14, 8, 4, 2, 1, 1, 47, 46, 29, 15, 8, 4, 2, 1, 1, 106, 99, 60, 32, 16, 8, 4, 2, 1, 1, 235, 216, 128, 66, 33, 16, 8, 4, 2, 1, 1, 551, 488, 284, 143, 69, 34, 16, 8, 4, 2, 1, 1, 1301, 1121, 636, 315
(list; table; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
COMMENT
|
Row sums are A005195.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Forest
|
|
FORMULA
|
T(n, k)= sum over the partitions of n, 1M1+2M2+...+nMn, with exactly k parts, of product_{1=<i<=n}C(A000055(i)+Mi-1, Mi). - Washington Bomfim (webonfim(AT)bol.com.br), May 12 2005
|
|
EXAMPLE
|
1; 1, 1; 1, 1, 1; 2, 2, 1, 1; 3, 3, 2, 1, 1; ...
|
|
CROSSREFS
|
Cf. A005195.
Cf. A106240.
Sequence in context: A050603 A037162 A027358 this_sequence A126081 A102481 A110659
Adjacent sequences: A095130 A095131 A095132 this_sequence A095134 A095135 A095136
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com), May 29, 2004
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 03 2004
|
|
|
Search completed in 0.002 seconds
|
