The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160382 Number of 2's in base 4 representation of n. 2
 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 1, 0, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 3, 2, 1, 1, 2, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 2, 1, 0, 0, 1, 0, 1, 1, 2, 1, 1, 1, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 LINKS F. T. Adams-Waters, F. Ruskey, Generating Functions for the Digital Sum and Other Digit Counting Sequences, JIS 12 (2009) 09.5.6 FORMULA Recurrence relation: a(0) = 0, a(4m+2) = 1+a(m), a(4m) = a(4m+1) = a(4m+3) = a(m). Generating function: 1/(1-z) * SUM( z^(2*4^m)*(1 - z^(4^m) )/( 1 - z^(4^(m+1)) ), m >= 0 ). Morphism: 0, j -> j,j,j+1,j; e.g., 0 -> 0010 -> 0010110111210010 -> ... CROSSREFS Sequence in context: A025435 A304685 A186714 * A081221 A280827 A103840 Adjacent sequences:  A160379 A160380 A160381 * A160383 A160384 A160385 KEYWORD nonn,base,easy AUTHOR Frank Ruskey, Jun 05 2009 STATUS approved

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 January 20 14:02 EST 2020. Contains 331094 sequences. (Running on oeis4.)