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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A161511 Number of 1...0 pairs in binary representation of 2n. 8
0, 1, 2, 2, 3, 3, 4, 3, 4, 4, 5, 4, 6, 5, 6, 4, 5, 5, 6, 5, 7, 6, 7, 5, 8, 7, 8, 6, 9, 7, 8, 5, 6, 6, 7, 6, 8, 7, 8, 6, 9, 8, 9, 7, 10, 8, 9, 6, 10, 9, 10, 8, 11, 9, 10, 7, 12, 10, 11, 8, 12, 9, 10, 6, 7, 7, 8, 7, 9, 8, 9, 7, 10, 9, 10, 8, 11, 9, 10, 7, 11, 10, 11, 9, 12, 10, 11, 8, 13, 11, 12, 9, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Row (partition) sums of A125106.

LINKS

Table of n, a(n) for n=0..92.

FORMULA

a(2n) = a(n) + A000120(n); a(2n+1) = a(n) + 1.

EXAMPLE

For n = 5, the binary representation of 2n is 1010; the 1...0 pairs are 10xx, 1xx0, and xx10, so a(5) = 3.

PROG

(PARI) a(n)=local(t, k); t=0; k=1; while(n>0, if(n%2==0, k++, t+=k); n\=2); t

CROSSREFS

Cf. A000120, A125106.

Sequence in context: A207034 A218829 A056239 * A100197 A057022 A087504

Adjacent sequences:  A161508 A161509 A161510 * A161512 A161513 A161514

KEYWORD

nonn

AUTHOR

Franklin T. Adams-Watters, Jun 11 2009

STATUS

approved

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 June 19 19:50 EDT 2013. Contains 226416 sequences.