|
%I #13 Dec 01 2018 12:20:53
%S 1,2,2,1,1,2,2,2,1,1,1,2,2,2,2,1,1,1,1,1,2,2,2,2,2,2,1,1,1,1,1,1,2,2,
%T 2,2,2,2,2,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,2,2,2,2,2,2,
%U 2,2,2,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2
%N For any sequence f of positive integers, let g(f) be the unique Golomb-like sequence with run lengths given by f and let k(f) be the unique Kolakoski-like sequence with run lengths given by f and initial term 1; this sequence is the unique sequence f satisfying f = k(g(f)).
%C See A321695 for the RUNS transform of this sequence and additional comments.
%H Rémy Sigrist, <a href="/A321696/b321696.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A321696/a321696.gp.txt">PARI program for A321696</a>
%e We can build this sequence alongside A321695 iteratively:
%e - this sequence starts with 1,
%e - hence A321695 starts with 1, 2 (after the initial run of 1's, we have a run of 2's),
%e - hence this sequence starts with 1, 2, 2, 1, 1, 2 (after the second run of 1's, we have a run of 2's),
%e - hence A321695 starts with 1, 2, 2, 3, 3, 4, 5, 6, 6, 7,
%e - hence this sequence starts with 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1,
%e - etc.
%o (PARI) See Links section.
%Y Cf. A000002, A001462, A321695.
%K nonn
%O 1,2
%A _Rémy Sigrist_, Nov 18 2018
|
