|
Search: id:A138650
|
|
|
| A138650 |
|
Table where T(n,k) is the number of unordered trees with n edges (n+1 nodes) whose node out-degrees form the k-th partition of the integer n (in Mathematica order). |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 4, 1, 1, 2, 2, 4, 4, 6, 1, 1, 2, 2, 4, 1, 8, 7, 2, 11, 9, 1, 1, 2, 2, 4, 2, 8, 7, 6, 5, 21, 11, 9, 24, 12, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
EXAMPLE
|
For the partition [2,1^2] (a(10)=T(4,4)) there are the four trees:
..o.....o.....o.....o
./.\.../.\....|.....|
o...o.o...o...o.....o
|...|.|....../.\....|
o...o.o.....o...o...o
......|.....|....../.\
......o.....o.....o...o
|
|
CROSSREFS
|
Cf. A000041 (row lengths), A000081 (row sums), A125181.
Sequence in context: A046067 A132066 A102190 this_sequence A137843 A130194 A113926
Adjacent sequences: A138647 A138648 A138649 this_sequence A138651 A138652 A138653
|
|
KEYWORD
|
more,nonn,tabf
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), May 15 2008
|
|
|
Search completed in 0.002 seconds
|
