Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000418
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000418 Number of n-node rooted trees of height 7.
(Formerly M4408 N1862)
+0
1
0, 0, 0, 0, 0, 0, 0, 1, 7, 34, 136, 487, 1615, 5079, 15349, 45009, 128899, 362266, 1002681, 2740448, 7411408, 19865445, 52840977, 139624510, 366803313, 958696860, 2494322662, 6463281890, 16686206047, 42935345688, 110142163940, 281763465941 (list; graph; listen)
OFFSET

1,9

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

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

MAPLE

For Maple program see link in A000235.

CROSSREFS

Sequence in context: A036632 A036639 A036646 this_sequence A055852 A122611 A014915

Adjacent sequences: A000415 A000416 A000417 this_sequence A000419 A000420 A000421

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