login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092462 n times the coefficient of x^n in log[1 + sum(k>=0, x^2^k)]. 0
0, 1, 1, -2, 5, -4, -2, 8, -3, -2, 6, -10, 2, 14, -20, 8, 29, -50, 34, 20, -90, 110, -32, -114, 210, -154, -64, 322, -380, 88, 408, -712, 477, 350, -1206, 1228, -34, -1738, 2604, -1276, -1978, 4798, -4160, -902, 7452, -9712, 3428, 9166, -18574, 14022, 6456, -29990, 34780 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
PROG
(PARI) a(n)=n*polcoeff(log(1+sum(k=0, 8, x^(2^k))+O(x^257)), n)
CROSSREFS
Cf. A036987.
Sequence in context: A324051 A307037 A049060 * A256357 A160826 A057149
KEYWORD
sign
AUTHOR
Ralf Stephan, Mar 24 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)