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 A111439 #8 Jan 28 2017 14:41:07 %S A111439 1,2,3,2,3,4,3,4,5,6,5,6,5,6,7,6,7,8,7,8,9,8,9,8,9,10,9,10,9,10,11,10, %T A111439 11,10,11,10,11,12,11,12,13,12,13,12,13,12,13,12,13,14,15,14,15,14,15, %U A111439 14,15,14,15,14,15,16,15,16,17,16,17,16,17 %N A111439 Variation of Golomb's sequence: a(n) is the number of times n appears with a(n) unequal to a(n-1). %C A111439 a(n) is understood to be the smallest number >=a(n-2) fitting the description. %H A111439 Rémy Sigrist, <a href="/A111439/b111439.txt">Table of n, a(n) for n = 1..10000</a> %o A111439 (PARI) r = vector(69,k,-1); p = 0; for (i=1, #r, v = 1; while (v==p || r[v]==0, v++); r[i]=v; r[v]--; print1 (v ", "); p=v); \\ _Rémy Sigrist_, Jan 28 2017 %Y A111439 Bisections: A080606 and A080605. Cf. A001462 (Golomb's sequence). %K A111439 nonn %O A111439 1,2 %A A111439 _Floor van Lamoen_, Nov 14 2005 %E A111439 Offset corrected by _Rémy Sigrist_, Jan 28 2017