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 A095772 #8 Nov 16 2015 08:15:25 %S A095772 2,1,2,1,2,1,2,2,1,1,1,3,2,1,1,2,1,1,1,4,2,1,1,1,1,1,2,3,1,1,1,1,5,2, %T A095772 1,1,1,2,1,1,1,1,1,1,1,2,3,4,1,1,1,1,1,6,2,1,1,1,1,1,1,1,2,1,2,3,1,1, %U A095772 1,1,1,1,1,1,1,1,1,2,3,4,5,1,1,1,1,1,1,7,2,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1 %N A095772 Number of times n appears in A093878. %H A095772 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 A095772 a(A000045(n)-1) = n-4 for n>4. %o A095772 (PARI) v=vector(1000,j,1);for(n=3,1000,g=v[v[v[n-1]]]+v[n-v[v[n-1]]];v[n]=g);a(n)=sum(i=1,3*n,if(v[i]-n,0,1)) %Y A095772 Cf. A004001, A051135. %K A095772 nonn %O A095772 1,1 %A A095772 _Benoit Cloitre_, Jun 05 2004