|
|
A103586
|
|
a(0)=1, for n > 0: n-th run consists of 2^n-1 copies of n+1.
|
|
7
|
|
|
1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
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
|
|
|
MATHEMATICA
|
Join[{1}, Flatten[Table[PadRight[{}, 2^n-1, n+1], {n, 6}]]] (* Harvey P. Dale, Aug 22 2021 *)
|
|
PROG
|
(Haskell)
a103586 n = a070939 (n + a070939 n)
a103586_list = 1 : concat
(zipWith (replicate . fromInteger) (tail a000225_list) [2..])
|
|
CROSSREFS
|
Number of bits in binary representation of A102370(n).
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|