This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A321696 #13 Dec 01 2018 12:20:53 %S A321696 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 A321696 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 A321696 2,2,2,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2 %N A321696 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 A321696 See A321695 for the RUNS transform of this sequence and additional comments. %H A321696 Rémy Sigrist, <a href="/A321696/b321696.txt">Table of n, a(n) for n = 1..10000</a> %H A321696 Rémy Sigrist, <a href="/A321696/a321696.gp.txt">PARI program for A321696</a> %e A321696 We can build this sequence alongside A321695 iteratively: %e A321696 - this sequence starts with 1, %e A321696 - hence A321695 starts with 1, 2 (after the initial run of 1's, we have a run of 2's), %e A321696 - 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 A321696 - hence A321695 starts with 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, %e A321696 - 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 A321696 - etc. %o A321696 (PARI) See Links section. %Y A321696 Cf. A000002, A001462, A321695. %K A321696 nonn %O A321696 1,2 %A A321696 _Rémy Sigrist_, Nov 18 2018