|
|
A282244
|
|
Lexicographic block-fractal zero-one word with initial block 01.
|
|
1
|
|
|
0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
COMMENTS
|
To the initial block, 01, append the lexicographically ordered missing 2-letter words (00,10,11) to get 01001011. To that, append the missing 3-letter words to get 01001011000110111. To that, append the missing 4-letter words to get 010010110001101110000101011101111, etc. In the limiting word, every finite binary word occurs infinitely many times; thus, the word (or sequence) is block-fractal, as defined at A280511.
|
|
LINKS
|
|
|
MATHEMATICA
|
str = "01"; t = Table[str = str <> StringJoin[Map[#[[1]] &,
Select[Map[{#, Length[StringPosition[str, #, 1]] > 0} &,
Table[StringJoin[Map[ToString, IntegerDigits[n, 2, k]]], {n,
0, 2^k - 1}]], ! #[[2]] &]]], {k, 7}]
ToExpression[Characters[Last[t]]] (* _Peter J. C. Moses, Mar 11 2017 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|