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 A071292 #2 Oct 03 2013 09:37:43
%S A071292 1,1,1,1,1,1,1,2,2,1,2,1,1,2,1,1,2,1,2,1,2,1,2,1,2,1,2,1,1,2,2,1,2,1,
%T A071292 2,1,2,1,2,2,1,2,1,2,2,1,2,1,2,2,1,2,1,2,2,1,2,2,1,2,1,2,2,1,2,2,1,2,
%U A071292 2,2,1,2,2,1,2,2,1,2,2,1,2,2,2,1,2,2,1,2,2,1,2,2,2,1,2,2,1,2,2,2
%N A071292 Call f(n) the sum of the first n primes then a(n) is the number of squares between f(n) and f(n+1).
%C A071292 a(n)>=1.
%H A071292 Internet Math. Olympiad, <a href="http://MathOlymp.com/OLYMP/Feb02/Feb02.html">February: Problem 1</a>
%t A071292 squareQ[n_] := IntegerQ[Sqrt[n]] f[n_] := Sum[Prime[i], {i, 1, n}] a[n_] := Length[Select[Table[i, {i, a[n], a[n + 1]}], squareQ]]
%K A071292 nonn
%O A071292 1,8
%A A071292 _Santi Spadaro_, Jun 11 2002