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!)
A048811 Number of rooted trees with n nodes with every leaf at height 6. 3
1, 1, 2, 3, 6, 9, 17, 27, 47, 78, 135, 224, 384, 642, 1088, 1827, 3088, 5182, 8736, 14661, 24660, 41378, 69500, 116534, 195509, 327627, 549104, 919593, 1539985, 2577399, 4313102, 7214374, 12064930, 20169283, 33710370, 56324729, 94089240 (list; graph; refs; listen; history; text; internal format)
OFFSET

7,3

LINKS

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

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048810 shifted right.

CROSSREFS

Cf. A048808-A048816.

Column k=6 of A244925.

Sequence in context: A320271 A056532 A079289 * A142155 A092351 A048812

Adjacent sequences:  A048808 A048809 A048810 * A048812 A048813 A048814

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 20 14:40 EST 2019. Contains 319333 sequences. (Running on oeis4.)