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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048814 Number of rooted trees with n nodes with every leaf at height 9. 3
1, 1, 2, 3, 6, 9, 17, 28, 49, 83, 144, 244, 422, 719, 1234, 2109, 3615, 6173, 10565, 18042, 30839, 52653, 89927, 153462, 261931, 446818, 762190, 1299678, 2215990, 3777230, 6437673, 10969447, 18688879, 31834676, 54220089, 92331502 (list; graph; refs; listen; history; text; internal format)
OFFSET

10,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 10..1000

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048813 shifted right.

CROSSREFS

Cf. A048808-A048816.

Column k=9 of A244925.

Sequence in context: A092351 A048812 A048813 * A048815 A074045 A073776

Adjacent sequences:  A048811 A048812 A048813 * A048815 A048816 A048817

KEYWORD

nonn

AUTHOR

Christian G. Bower, Apr 15 1999

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 14:12 EST 2019. Contains 319225 sequences. (Running on oeis4.)