|
Search: id:A034824
|
|
|
| A034824 |
|
Number of n-node rooted trees of height at most 7. |
|
+0
4
|
|
| 1, 1, 1, 2, 4, 9, 20, 48, 115, 285, 710, 1789, 4514, 11431, 28922, 73182, 184917, 466755, 1176393, 2961205, 7443770, 18689435, 46869152, 117412440, 293832126, 734645046, 1835147741, 4580420719, 11423511895, 28469058647, 70899220083
(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 A034823 and shift right. (Christian G. Bower (bowerc(AT)usa.net)).
|
|
MAPLE
|
For Maple program see link in A000235.
with (numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d, j; if n=0 then 1 else add (add (d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: shr:= proc(p) n->`if`(n=0, 1, p(n-1)) end: b[0]:= etr(n->1): for j from 1 to 5 do b[j]:= etr (shr(b[j-1])) od: a:= shr(b[5]): seq (a(n), n=0..31); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 08 2008]
|
|
CROSSREFS
|
See A001383 for details.
Sequence in context: A003019 A036626 A036722 this_sequence A145545 A034825 A145546
Adjacent sequences: A034821 A034822 A034823 this_sequence A034825 A034826 A034827
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
