login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000429 Number of n-node rooted trees of height 8.
(Formerly M4525 N1918)
1
0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 43, 188, 728, 2593, 8706, 27961, 86802, 262348, 776126, 2256418, 6466614, 18311915, 51334232, 142673720, 393611872, 1078955836, 2941029334, 7977065816, 21541492856, 57942770689, 155304829763, 414934057486 (list; graph; refs; listen; history; internal format)
OFFSET

1,10

REFERENCES

J. Riordan, Enumeration of trees by height and diameter, IBM J. Res. Dev. 4 (1960), 473-478.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

N. J. A. Sloane, Table of n, a(n) for n=1..200

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

A034825-A034824. (Christian G. Bower (bowerc(AT)usa.net)).

MAPLE

For Maple program see link in A000235.

CROSSREFS

Sequence in context: A036633 A036640 A036647 * A055853 A137748 A005024

Adjacent sequences:  A000426 A000427 A000428 * A000430 A000431 A000432

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 13:46 EST 2012. Contains 205807 sequences.