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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A048808 Number of rooted trees with n nodes with every leaf at height 3. 9
1, 1, 2, 3, 5, 7, 12, 18, 27, 42, 64, 96, 146, 219, 327, 491, 730, 1084, 1608, 2376, 3500, 5154, 7563, 11076, 16193, 23625, 34395, 50005, 72550, 105089, 151984, 219448, 316362, 455434, 654661, 939736, 1347137, 1928593, 2757449, 3937675 (list; graph; refs; listen; history; internal format)
OFFSET

4,3

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A002865 (with a(0)=0) shifted right.

CROSSREFS

Cf. A048809-A048816.

Sequence in context: A002965 A206290 A091696 * A013983 A169986 A191385

Adjacent sequences:  A048805 A048806 A048807 * A048809 A048810 A048811

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Apr 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:38 EST 2012. Contains 205694 sequences.