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 A095773 #11 Nov 16 2015 08:19:54
%S A095773 1,2,2,3,3,4,4,5,5,6,6,6,7,7,7,8,8,8,9,9,9,10,10,10,10,11,11,11,11,12,
%T A095773 12,12,12,13,13,13,13,14,14,14,14,15,15,15,15,16,16,16,16,16,17,17,17,
%U A095773 17,17,18,18,18,18,18,19,19,19,19,19,20,20,20,20,20,21,21,21,21,21,22
%N A095773 a(1)=1, a(n) = 1 + a(n - a(a(a(n-1)))).
%C A095773 A generalization of Golomb's sequence.
%C A095773 a(10^n): 1, 6, 26, 124, 611, 2963, 14172, ...
%H A095773 J. Grytczuk, <a href="http://dx.doi.org/10.1016/j.disc.2003.10.022">Another variation on Conway's recursive sequence</a>, Discr. Math. 282 (2004), 149-161.
%F A095773 Is a(n) asymptotic to r^(r-1)*n^r where r is the positive root of x^3+x=1 and so r=0.682327803828019327...?
%t A095773 a[1] = 1; a[n_] := a[n] = 1 + a[n - a[a[a[n - 1]]]]; Table[ a[n], {n, 80}] (* _Robert G. Wilson v_, Jun 09 2004 *)
%o A095773 (PARI) v=vector(1000,j,1);for(n=2,1000,g=v[n-v[v[v[n-1]]]]+1;v[n]=g);a(n)=v[n]
%Y A095773 Cf. A001462, A095774, A095775.
%K A095773 nonn
%O A095773 1,2
%A A095773 _Benoit Cloitre_, Jun 05 2004