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!)
A048813 Number of rooted trees with n nodes with every leaf at height 8. 3
1, 1, 2, 3, 6, 9, 17, 28, 49, 82, 143, 241, 417, 707, 1213, 2065, 3534, 6014, 10272, 17487, 29820, 50758, 86469, 147123, 250429, 425932, 724517, 1231765, 2094116, 3558799, 6047447, 10273349, 17450221, 29633832, 50317376, 85420630 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,3

LINKS

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

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048812 shifted right.

CROSSREFS

Cf. A048808-A048816.

Column k=8 of A244925.

Sequence in context: A142155 A092351 A048812 * A048814 A048815 A074045

Adjacent sequences:  A048810 A048811 A048812 * A048814 A048815 A048816

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 16 06:59 EST 2019. Contains 319188 sequences. (Running on oeis4.)