login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159912 Partial sums of A159913(k) = 2^bitcount(2k+1)-1 = A038573(2k+1), bitcount=A000120. 3
0, 1, 4, 7, 14, 17, 24, 31, 46, 49, 56, 63, 78, 85, 100, 115, 146, 149, 156, 163, 178, 185, 200, 215, 246, 253, 268, 283, 314, 329, 360, 391, 454, 457, 464, 471, 486, 493, 508, 523, 554, 561, 576, 591, 622, 637, 668, 699, 762, 769, 784, 799, 830, 845, 876, 907 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

More precisely, a(n)=sum(i<n, A159913(i)), since we want the sequence to start with a(0)=0 and not with A159913(0)=1.

FORMULA

a(n) = sum( i=0...n-1, A159913(i)) = sum(i=0..n-1, 2^A000120(i))*2-n

PROG

(PARI) A159912(n)=sum(i=0, n-1, 1<<norml2(binary(i)))*2-n

CROSSREFS

Cf. A000120, A038573.

Sequence in context: A062380 A072031 A007437 * A183060 A049766 A161426

Adjacent sequences:  A159909 A159910 A159911 * A159913 A159914 A159915

KEYWORD

nonn

AUTHOR

M. F. Hasler (www.univ-ag.fr/~mhasler), May 03 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.