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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Felix FrÃ¶hlich, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A002275(A000523(n+1)) = A032810(n)-A007931(n) = A032834(n)-A032810(n), etc. 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 Sequence in context: A090862 A291498 A290656 * A287503 A286863 A288121 Adjacent sequences:  A256074 A256075 A256076 * A256078 A256079 A256080 KEYWORD nonn AUTHOR M. F. Hasler, Mar 21 2015 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 August 11 23:45 EDT 2020. Contains 336434 sequences. (Running on oeis4.)