cp's OEIS Frontend

A115593 Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0).

%I A115593 #39 Sep 25 2023 15:02:56
%S A115593 1,1,1,2,2,3,4,6,7,10,13,17,22,29,38,50,64,82,107,136,175,224,288,363,
%T A115593 465,587,748,942,1196,1503,1902,2385,3004,3765,4729,5911,7406,9246,
%U A115593 11549,14395,17941,22326,27767,34501,42821,53134,65828,81546,100871,124783
%N A115593 Number of forests of rooted trees with total weight n, where a node at height k has weight 2^k (with root considered to be at height 0).
%C A115593 The sequence b(2n)=0, b(2n+1)=a(n) is the number of trees of weight n.
%H A115593 Alois P. Heinz, <a href="/A115593/b115593.txt">Table of n, a(n) for n = 0..5000</a>
%H A115593 Hartosh Singh Bal, <a href="https://arxiv.org/abs/2308.00455">Combinatorics of a Class of Completely Additive Arithmetic Functions</a>, arXiv:2308.00455 [math.CO], 2023.
%F A115593 Euler transform of b(n), where b(2n+1) = a(n) and b(2n) = 0.
%F A115593 From _Paul D. Hanna_, Oct 26 2011: (Start)
%F A115593 G.f. satisfies: A(x) = exp( Sum_{n>=1} A(x^(2*n)) * x^n/n ).
%F A115593 G.f. satisfies: A(x)*A(-x) = A(x^2). (End)
%F A115593 Let b(n) = a(n-1) for n>=1, then sum(n>=1, b(n)*x^n ) = x / prod(n>=1, (1-x^(2*n-1))^b(n) ); compare to A000081, A004111, and A073075. - _Joerg Arndt_, Mar 04 2015
%F A115593 a(0) = 1; a(n) = (1/n) * Sum_{k=1..n} ( Sum_{d|k and d is odd} d * a(floor(d/2)) ) * a(n-k). - _Seiichi Manyama_, May 31 2023
%e A115593 a(3) = 2; one forest with 3 single-node trees and one with a single two-node tree (root node has weight 1, other node has weight 2).
%p A115593 with(numtheory):
%p A115593 b:= proc(n) local r; `if`(irem(n, 2, 'r')=0, 0, a(r)) end:
%p A115593 a:= proc(n) option remember; `if`(n=0, 1,
%p A115593        add(add(d*b(d), d=divisors(j))*a(n-j), j=1..n)/n)
%p A115593     end:
%p A115593 seq(a(n), n=0..50);  # _Alois P. Heinz_, May 16 2013
%t A115593 b[n_] := b[n] = If[{q, r} = QuotientRemainder[n, 2]; r == 0, 0, a[q]]; a[n_] := a[n] = If[n == 0, 1, Sum[Sum[d*b[d], {d, Divisors[j]}]*a[n-j], {j, 1, n}]/n]; Table[a[n], {n, 0, 50}] (* _Jean-François Alcover_, Mar 23 2015, after _Alois P. Heinz_ *)
%o A115593 (PARI) {a(n)=my(A=1+x); for(i=1, n, A=exp(sum(m=1, n, subst(A,x,x^(2*m)+x*O(x^n))*x^m/m))); polcoeff(A,n)} /* _Paul D. Hanna_ */
%Y A115593 Cf. A000081, A117356, A363336, A363337.
%K A115593 easy,nonn
%O A115593 0,4
%A A115593 _Franklin T. Adams-Watters_, Mar 09 2006