|
|
A256077
|
|
Repeat 2^d times the repunit A002275(d); d = 1, 2, 3...
|
|
7
|
|
|
1, 1, 11, 11, 11, 11, 111, 111, 111, 111, 111, 111, 111, 111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 1111, 11111, 11111, 11111, 11111, 11111, 11111, 11111, 11111, 11111, 11111, 11111, 11111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Yields the length of the n-th (nonempty) binary word (or word over any 2-letter alphabet, like A007931 or A032810 or A032834) in tally mark notation (A000042).
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
lim = 5; lst = Table[(10^n - 1)/9, {n, 0, lim}]; Reap@ For[i = 1, i <= lim, i++, Sow@ Table[lst[[i + 1]], {d, 2^i}]] // Flatten // Rest (* Michael De Vlieger, Apr 01 2015 *)
|
|
PROG
|
(PARI) a(n)=10^#binary(n+1)\90
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|