%I A034824
%S A034824 1,1,1,2,4,9,20,48,115,285,710,1789,4514,11431,28922,73182,184917,
%T A034824 466755,1176393,2961205,7443770,18689435,46869152,117412440,293832126,
%U A034824 734645046,1835147741,4580420719,11423511895,28469058647,70899220083
%N A034824 Number of n-node rooted trees of height at most 7.
%H A034824 N. J. A. Sloane, <a href="b034824.txt">Table of n, a(n) for n=0..200</
               a>
%H A034824 N. J. A. Sloane, <a href="transforms.txt">Transforms</a>
%H A034824 <a href="Sindx_Ro.html#rooted">Index entries for sequences related to 
               rooted trees</a>
%F A034824 Take Euler transform of A034823 and shift right. (Christian G. Bower 
               (bowerc(AT)usa.net)).
%p A034824 For Maple program see link in A000235.
%p A034824 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]
%Y A034824 See A001383 for details.
%Y A034824 Sequence in context: A003019 A036626 A036722 this_sequence A145545 A034825 
               A145546
%Y A034824 Adjacent sequences: A034821 A034822 A034823 this_sequence A034825 A034826 
               A034827
%K A034824 nonn
%O A034824 0,4
%A A034824 N. J. A. Sloane (njas(AT)research.att.com).