

A066323


Number of one bits in binary representation of base i1 expansion of n (where i = sqrt(1)).


1



0, 1, 2, 3, 4, 5, 6, 7, 3, 4, 5, 6, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 8, 4, 5, 6, 7, 3, 4, 5, 6, 2, 3, 4, 5, 6, 7, 8, 9, 5, 6, 7, 8, 4, 5, 6, 7, 3, 4, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 5, 6, 7, 8, 4, 5, 6, 7, 8, 9, 10, 11, 7, 8, 9, 10, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 11, 12, 8, 9, 10, 11, 7, 8, 9, 10, 6, 7, 8, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

First differences are usually +1, occasionally 4 (because in base i1 [3]+[7]=(+i)+(i)=0) hence often a(i+j)=a(i)+a(j). Differences terms given here are period16, but for full sequence is actually period256 at least.


REFERENCES

D. E. Knuth, The Art of Computer Programming. AddisonWesley, Reading, MA, 1969, Vol. 2, p. 172, (Also exercise 16, p. 177, answer, p. 494)


LINKS

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


EXAMPLE

A066321(4) = 464 = 111010000 (binary) so a(4) = 4.


CROSSREFS

Cf. A066321, A000120.
Sequence in context: A104415 A071074 A279648 * A245347 A278059 A115871
Adjacent sequences: A066320 A066321 A066322 * A066324 A066325 A066326


KEYWORD

base,easy,nonn


AUTHOR

Marc LeBrun, Dec 14 2001


STATUS

approved



