Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134527
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134527 G.f. A(x) satisfies: A(x) = Sum_{n>=0} [x*A(x)]^(2^n-1). +0
1
1, 1, 1, 2, 5, 11, 24, 58, 149, 385, 1001, 2652, 7140, 19384, 52944, 145590, 402949, 1121117, 3133255, 8793372, 24774557, 70045871, 198672464, 565144064, 1611946284, 4609140916, 13209415116, 37937455636, 109171460104 (list; graph; listen)
OFFSET

0,4

FORMULA

G.f.: A(x) = Series_Reversion{x/[Sum_{n>=0} x^(2^n-1)]}.

PROGRAM

(PARI) a(n)=polcoeff(serreverse(x/sum(j=0, #binary(n), x^(2^j-1)+x*O(x^n))), n)

CROSSREFS

Sequence in context: A018115 A018007 A071879 this_sequence A124379 A084978 A118036

Adjacent sequences: A134524 A134525 A134526 this_sequence A134528 A134529 A134530

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 19 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research