|
|
A269352
|
|
Kolakoski-(1,10) sequence: a(n) is length of n-th run.
|
|
1
|
|
|
1, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
No prime number with the union of many terms.
|
|
LINKS
|
|
|
MATHEMATICA
|
seed = {1, 10}; w = {}; i = 1; Do[w = Join[w, Array[seed[[Mod[i - 1, Length[seed]] + 1]]&, If[i > Length[w], seed, w][[i]]]]; i++, {n, 42}]; w
|
|
CROSSREFS
|
Cf. similar sequences listed in A269268.
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|