Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048809
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048809 Number of rooted trees with n nodes with every leaf at height 4. +0
3
1, 1, 2, 3, 6, 8, 15, 23, 39, 61, 102, 161, 265, 420, 682, 1087, 1753, 2790, 4476, 7120, 11376, 18075, 28785, 45666, 72530, 114882, 182040, 287878, 455231, 718755, 1134491, 1788461, 2818140, 4436000, 6978932, 10969695, 17232572, 27049320 (list; graph; listen)
OFFSET

5,3

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Euler transform of A048808 shifted right.

CROSSREFS

Cf. A048808-A048816.

Sequence in context: A075723 A138137 A129374 this_sequence A047001 A091070 A133586

Adjacent sequences: A048806 A048807 A048808 this_sequence A048810 A048811 A048812

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