Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157313
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157313 G.f.: exp( Sum_{n>=1} a(n)*x^n/n ) = Product_{n>=1} 1/(1 - a(n-1)*x^n). +0
2
1, 1, 3, 10, 43, 216, 1326, 9283, 74667, 672085, 6730098, 74031079, 888657130, 11552542691, 161747905609, 2426218982400, 38820193151115, 659943283568956, 11879029341157575, 225701557481993926, 4514035666639844778 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n) = Sum_{d divides n, 1<=d<=n} d * a(d-1)^(n/d) for n>0 with a(0)=1.

Product_{n>=1} 1/(1 - a(n-1)*x^n) = g.f. of A157314.

EXAMPLE

Define G(x) by the exponential:

G(x) = exp(x + 3*x^2/2 + 10*x^3/3 + 43*x^4/4 + 216*x^5/5 + 1326*x^6/6 +...)

then 1/G(x) also equals the product:

1/G(x) = (1 - x)(1 - x^2)(1 - 3*x^3)(1 - 10*x^4)(1 - 43*x^5)(1 - 216*x^6)*...

where the coefficients in both expressions are the same (with offset)

and G(x) is the g.f. of A157314:

G(x) = 1 + x + 2*x^2 + 5*x^3 + 16*x^4 + 62*x^5 + 298*x^6 + 1700*x^7 +...

PROGRAM

(PARI) {a(n)=if(n==0, 1, sumdiv(n, d, if(d>=1&d<=n, d*(a(d-1))^(n/d))))}

(PARI) {a(n)=if(n==0, 1, n*polcoeff(1+sum(k=1, n, -log(1-a(k-1)*x^k +x*O(x^n))), n))}

(PARI) {a(n)=if(n==0, 1, n*polcoeff(sum(k=1, n, sum(j=1, n\k, a(k-1)^j*x^(k*j)/j)+x*O(x^n)), n))}

CROSSREFS

Cf. A157314, A157311.

Sequence in context: A132428 A030890 A030833 this_sequence A030971 A006932 A001040

Adjacent sequences: A157310 A157311 A157312 this_sequence A157314 A157315 A157316

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Mar 10 2009

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research