|
| |
|
|
A127524
|
|
Number of unordered rooted trees where each subtree from given node has the same number of nodes.
|
|
1
| |
|
|
1, 1, 2, 3, 5, 6, 11, 12, 20, 25, 42, 43, 81, 82, 150, 192, 287, 288, 563, 564, 982, 1277, 2182, 2183, 3658, 3785, 7108, 8659, 13101, 13102, 27827, 27828, 47768, 61025, 102355, 105689, 170882, 170883, 329651, 421547, 606283, 606284, 1193038
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
FORMULA
| a(1) = 1; a(n+1) = sum_{d|n} C(a(n/d) + d-1, d).
|
|
|
EXAMPLE
| The tree shown below left counts, because the subtree shown on the left has 3 nodes and so does the one on the right and a similar condition holds for the subtrees. The tree shown on the right is not counted, because the subtree shown on the left has 3 nodes, while the one on the right has 4.
O..........O...O...O
|..........|....\./.
O...O...O..O.....O..
.\...\./....\....|..
.O...O......O...O..
..\./........\./...
...O..........O....
|
|
|
CROSSREFS
| Cf. A000081, A127525.
Sequence in context: A033159 A199366 A083710 * A117086 A081026 A137808
Adjacent sequences: A127521 A127522 A127523 * A127525 A127526 A127527
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Jan 17 2007
|
| |
|
|
