Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000429
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000429 Number of n-node rooted trees of height 8.
(Formerly M4525 N1918)
+0
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; listen)
OFFSET

1,10

REFERENCES

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

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

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

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 this_sequence A055853 A137748 A005024

Adjacent sequences: A000426 A000427 A000428 this_sequence A000430 A000431 A000432

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research