|
|
A103615
|
|
Number of zeros in A103542(n) (binary equivalent of A102370(n)).
|
|
1
|
|
|
1, 0, 1, 1, 2, 0, 2, 2, 3, 1, 1, 1, 2, 1, 3, 3, 4, 2, 2, 2, 3, 0, 2, 2, 3, 1, 1, 1, 3, 2, 4, 4, 5, 3, 3, 3, 4, 1, 3, 3, 4, 2, 2, 2, 2, 1, 3, 3, 4, 2, 2, 2, 3, 0, 2, 2, 3, 1, 1, 2, 4, 3, 5, 5, 6, 4, 4, 4, 5, 2, 4, 4, 5, 3, 3, 3, 3, 2, 4, 4, 5, 3, 3, 3, 4, 1, 3, 3, 4, 2, 2, 1, 3, 2, 4, 4, 5, 3, 3, 3, 4, 1, 3, 3, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
LINKS
|
David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
|
|
FORMULA
|
|
|
EXAMPLE
|
The sequence has a natural decomposition into blocks (see the paper): 1; 0; 1, 1, 2; 0, 2, 2, 3, 1, 1, 1; 2, 1, 3, 3, 4, 2, 2, 2, 3, 0, 2, 2, 3, 1, 1; 1, 3, ...
|
|
MAPLE
|
A023416 := proc(n) local digs : digs := convert(n, base, 2) : if nops(digs) = 0 then 1: else add(1-j, j=digs) : fi : end: ili := readline("b102370.txt") : while ili <> 0 do na := sscanf(ili, "%d %d") : na := A023416(op(2, na)) ; printf("%d, ", na) ; ili := readline("b102370.txt") : od: # R. J. Mathar, Aug 10 2007
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|