Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134774
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134774 G.f.: A(x) = Product_{n>=1} G(x^n,n)^n where G(x,n) = 1 + x*G(x,n)^n. +0
2
1, 1, 3, 6, 15, 26, 66, 110, 253, 460, 966, 1680, 3732, 6304, 13073, 23539, 47548, 82362, 171463, 293578, 597934, 1056830, 2105424, 3654919, 7533609, 12915780, 26112978, 46033557, 92504870, 160298673, 330468463, 568239653, 1161488784 (list; graph; listen)
OFFSET

0,3

FORMULA

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). G.f.: A(x) = Product_{n>=1} [ Series_Reversion( x/(1 + x^n) )/x ]^n.

EXAMPLE

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

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

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

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

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

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

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

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 +...] * ...

PROGRAM

(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))} (PARI) {a(n)=polcoeff(prod(m=1, n, (1/x*serreverse(x/(1+x^m +x*O(x^n))))^m), n)}

CROSSREFS

Cf. A105862 (LOG(A(x)); A056045 (variant); A000108 (Catalan), A001764, A002293.

Adjacent sequences: A134771 A134772 A134773 this_sequence A134775 A134776 A134777

Sequence in context: A062878 A020991 A079825 this_sequence A056278 A000740 A069712

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 11 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research