Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048808
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048808 Number of rooted trees with n nodes with every leaf at height 3. +0
10
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; listen)
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: A080528 A002965 A091696 this_sequence A013983 A143642 A060986

Adjacent sequences: A048805 A048806 A048807 this_sequence A048809 A048810 A048811

KEYWORD

nonn

AUTHOR

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

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research