This site is supported by donations to The OEIS Foundation.

 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. 5
 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; text; internal format)
 OFFSET 0,3 COMMENTS More precisely, a(n)=sum(i= 1. - Omar E. Pol, Jan 25 2016 MATHEMATICA Accumulate@ Table[2^(DigitCount[n, 2][[1]] + 1) - 1, {n, 0, 54}] (* Michael De Vlieger, Jan 25 2016 *) PROG (PARI) A159912(n)=sum(i=0, n-1, 1<

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

Last modified February 20 06:26 EST 2019. Contains 320332 sequences. (Running on oeis4.)