Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162588
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162588 G.f.: A(x) = exp( 2*Sum_{n>=1} 2^n/A006519(n) * x^n/n ), where A006519(n) = highest power of 2 dividing n. +0
2
1, 4, 10, 24, 52, 112, 240, 512, 1060, 2192, 4552, 9440, 19408, 39872, 81984, 168448, 342632, 696736, 1421200, 2897856, 5891872, 11976064, 24361856, 49543168, 100329952, 203147136, 411939264, 835168512, 1690383744, 3420860928 (list; graph; listen)
OFFSET

0,2

EXAMPLE

G.f.: A(x) = 1 + 4*x + 10*x^2 + 24*x^3 + 52*x^4 + 112*x^5 + 240*x^6 +...

log(A(x))/2 = 2*x + 2*x^2/2 + 8*x^3/3 + 4*x^4/4 + 32*x^5/5 + 32*x^6/6 + 128*x^7/7 +...

PROGRAM

(PARI) {a(n)=local(L=2*sum(m=1, n, 2^(m-valuation(m, 2))*x^m/m)+x*O(x^n)); polcoeff(exp(L), n)}

CROSSREFS

Cf. A006519, A000123.

Sequence in context: A093831 A052365 A107659 this_sequence A080615 A097976 A152548

Adjacent sequences: A162585 A162586 A162587 this_sequence A162589 A162590 A162591

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 07 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research