Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162287
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162287 G.f. satisfies: A(x) = exp( Sum_{n>=1} [Sum{d|n} A(2^d*n*x/d)^d/d]*x^n ). +0
1
1, 1, 4, 29, 417, 11629, 635575, 68495847, 14649466838, 6240047796536, 5303983470442186, 9004906378193235074, 30552213347609385960757, 207213131514991438965771387, 2809810971676044211903643478219 (list; graph; listen)
OFFSET

0,3

EXAMPLE

G.f.: A(x) = 1 + x + 4*x^2 + 29*x^3 + 417*x^4 + 11629*x^5 +...

log(A(x)) = A(2*x)*x + [A(2*2x) + A(2^2*x)^2/2]*x^2 + [A(2*3x) + A(2^3*x)^3/3]*x^3 + [A(2*4x) + A(2^2*2x)^2/2 + A(2^4*x)^4/4]*x^4 +...

PROGRAM

(PARI) {a(n)=local(A=1+x); for(i=1, n, A=exp(sum(m=1, n, sumdiv(m, d, m*subst(A, x, 2^d*m*x/d+x*O(x^n))^d/d)*x^m/m))); polcoeff(A, n)}

CROSSREFS

Cf. A162286.

Adjacent sequences: A162284 A162285 A162286 this_sequence A162288 A162289 A162290

Sequence in context: A137646 A000798 A135485 this_sequence A166168 A126559 A159862

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 29 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 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research