Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001385
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001385 Number of n-node trees of height at most 5.
(Formerly M1177 N0453)
+0
5
1, 1, 1, 2, 4, 9, 20, 47, 108, 252, 582, 1345, 3086, 7072, 16121, 36667, 83099, 187885, 423610, 953033, 2139158, 4792126, 10714105, 23911794, 53273599, 118497834, 263164833, 583582570, 1292276355, 2857691087, 6311058671, 13919982308 (list; graph; listen)
OFFSET

0,4

REFERENCES

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=0..200

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

Index entries for sequences related to trees

FORMULA

Take Euler transform of A001384 and shift right. (Christian G. Bower (bowerc(AT)usa.net)).

MAPLE

For Maple program see link in A000235.

CROSSREFS

See A001383 for details.

Adjacent sequences: A001382 A001383 A001384 this_sequence A001386 A001387 A001388

Sequence in context: A110198 A104508 A036623 this_sequence A039808 A138164 A130802

KEYWORD

nonn

AUTHOR

njas

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research