Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034826
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034826 Number of n-node rooted trees of height at most 9. +0
2
1, 1, 1, 2, 4, 9, 20, 48, 115, 286, 719, 1841, 4755, 12410, 32558, 85849, 226980, 601373, 1594870, 4232100, 11230771, 29798539, 79034638, 209526631, 555172356, 1470195001, 3891131705, 10292857772, 27212082536, 71905725130, 189911518888 (list; graph; listen)
OFFSET

0,4

LINKS

N. J. A. Sloane, Table of n, a(n) for n=0..200

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Take Euler transform of A034825 and shift right. (Christian G. Bower (bowerc(AT)usa.net)).

MAPLE

For Maple program see link in A000235.

CROSSREFS

See A001383 for details.

Sequence in context: A036722 A034824 A034825 this_sequence A123467 A000081 A124497

Adjacent sequences: A034823 A034824 A034825 this_sequence A034827 A034828 A034829

KEYWORD

nonn

AUTHOR

njas

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research