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 A024711 #5 May 31 2013 00:03:55 %S A024711 1,0,1,1,0,1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,1,0,0,1,0,1,1,0,0,1,0,1,1,0, %T A024711 1,1,0,1,1,1,0,0,1,0,1,0,1,1,0,0,0,1,0,0,1,0,1,0,1,1,1,0,0,1,1,0,1,1, %U A024711 0,0,0,1,1,0,1,1,0,0,1,1,0,0,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,1,1,1,1,0,1,0,1,0,0,0,0,1,0 %N A024711 a(n) = residue mod 2 of n-th term of A024702. %H A024711 Charles R Greathouse IV, <a href="/A024711/b024711.txt">Table of n, a(n) for n = 3..10000</a> %o A024711 (PARI) a(n)=my(p=prime(n)%8);p==3||p==5 \\ _Charles R Greathouse IV_, May 31 2013 %K A024711 nonn,easy %O A024711 3,1 %A A024711 _Clark Kimberling_