Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000553
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000553 Number of labeled rooted trees of height 4 with n nodes.
(Formerly M5378 N2335)
+0
1
120, 2520, 43680, 757680, 13747104, 264181680, 5395040640, 117080049240, 2696387899920, 65774992411128, 1695845836077120, 46110625382246880, 1319345179723609920, 39640903618873667040, 1248193457738661143808 (list; graph; listen)
OFFSET

5,1

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

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

E.g.f.: x*(exp(x*exp(x*exp(x*exp(x))))-exp(x*exp(x*exp(x)))). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 29 2008

MAPLE

ht := proc(m) local i; [ T0, {seq(T.i=Prod(Z, Set(T.(i+1))), i=0..m-1), T.m=Z}, labeled ] end: M[ 5378 ] := n -> count(ht(4), size=n)-count(ht(3), size=n): seq(M[ 5378 ](n), n=5..19);

CROSSREFS

Sequence in context: A166779 A038745 A032180 this_sequence A126232 A105943 A052721

Adjacent sequences: A000550 A000551 A000552 this_sequence A000554 A000555 A000556

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from P Zimmermann Mar 15 1996

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 December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research