Search: id:A034825
Results 1-1 of 1 results found.

%I A034825
%S A034825 1,1,1,2,4,9,20,48,115,286,718,1832,4702,12159,31515,81888,212878,
%T A034825 553557,1438741,3737331,9700188,25156049,65181067,168746672,436505846,
%U A034825 1128256918,2914103577,7521450053,19400577711,50010551503,128841990772
%N A034825 Number of n-node rooted trees of height at most 8.
%H A034825 N. J. A. Sloane, <a href="b034825.txt">Table of n, a(n) for n=0..200</
               a>
%H A034825 N. J. A. Sloane, <a href="transforms.txt">Transforms</a>
%H A034825 <a href="Sindx_Ro.html#rooted">Index entries for sequences related to 
               rooted trees</a>
%F A034825 Take Euler transform of A034824 and shift right. (Christian G. Bower 
               (bowerc(AT)usa.net)).
%p A034825 For Maple program see link in A000235.
%p A034825 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 6 do b[j]:= etr (shr(b[j-1])) od: a:= 
               shr(b[6]): seq (a(n), n=0..31); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), 
               Sep 08 2008]
%Y A034825 See A001383 for details.
%Y A034825 Sequence in context: A036722 A034824 A145545 this_sequence A145546 A034826 
               A145547
%Y A034825 Adjacent sequences: A034822 A034823 A034824 this_sequence A034826 A034827 
               A034828
%K A034825 nonn
%O A034825 0,4
%A A034825 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.001 seconds