login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A134774 G.f.: A(x) = Product_{n>=1} G(x^n,n)^n where G(x,n) = 1 + x*G(x,n)^n. 1

%I #9 Oct 31 2019 05:29:57

%S 1,1,3,6,15,26,66,110,253,460,966,1680,3732,6304,13073,23539,47548,

%T 82362,171463,293578,597934,1056830,2105424,3654919,7533609,12915780,

%U 26112978,46033557,92504870,160298673,330468463,568239653,1161488784

%N G.f.: A(x) = Product_{n>=1} G(x^n,n)^n where G(x,n) = 1 + x*G(x,n)^n.

%F G.f.: A(x) = exp( Sum_{n>=1} A105862(n)/n*x^n ), where A105862(n) = Sum_{d|n} binomial(n,d)*n/gcd(n,d).

%F G.f.: A(x) = Product_{n>=1} [ Series_Reversion( x/(1 + x^n) )/x ]^n.

%e G.f.: A(x) = 1 + x + 3*x^2 + 6*x^3 + 15*x^4 + 26*x^5 + 66*x^6 +...

%e G.f.: A(x) = 1/(1-x) * G(x^2,2)^2 * G(x^3,3)^3 * G(x^4,4)^4 *...

%e where the functions G(x,n) are g.f.s of well-known sequences:

%e G(x,2) = g.f. of A000108 = 1 + x*G(x,2)^2;

%e G(x,3) = g.f. of A001764 = 1 + x*G(x,3)^3;

%e G(x,4) = g.f. of A002293 = 1 + x*G(x,4)^4 ; etc.

%e Explicitly, the product yielding the g.f. A(x) begins:

%e A(x) = [1 + x + x^2 + x^3 +...] * [1 + 2*x^2 + 5*x^4 + 14*x^6 +...] * [1 + 3*x^3 + 12*x^6 + 55*x^9 +...] * [1 + 4*x^4 + 22*x^8 + 140*x^12 +...] * ...

%o (PARI) a(n)=if(n==0,1, polcoeff(exp(sum(m=1,n, x^m*sumdiv(m,d, binomial(m,d)/gcd(m,d)))),n))

%o (PARI) a(n)=polcoeff(prod(m=1,n,(1/x*serreverse(x/(1+x^m +x*O(x^n))))^m),n)

%Y Cf. A105862 (log(A(x)); A056045 (variant); A000108 (Catalan), A001764, A002293.

%K nonn

%O 0,3

%A _Paul D. Hanna_, Nov 11 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)