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 A095770 #8 Nov 16 2015 08:15:30 %S A095770 0,1,1,1,0,1,1,0,1,1,1,0,1,1,0,1,1,0,1,1,1,1,0,0,1,1,0,1,1,1,1,1,1,1, %T A095770 0,0,0,1,1,0,1,1,1,0,1,1,1,1,1,1,1,1,0,0,0,0,1,1,0,1,1,1,1,1,1,0,1,0, %U A095770 0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,1,0 %N A095770 First differences of A095769. %H A095770 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. %o A095770 (PARI) v=vector(150,j,1);for(n=3,150,g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]];v[n]=g);a(n)=v[n+1]-v[n] %Y A095770 Cf. A004001, A093878, A095769, A095771. %K A095770 nonn %O A095770 1,1 %A A095770 _Benoit Cloitre_, Jun 05 2004