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 A224699 #16 Apr 16 2013 15:40:52
%S A224699 1,7,12,26,49,55,106,106,163,229,229,307,343,343,394,458,655,655,655,
%T A224699 655,758,812,1358,1472,1472,1472,1618,1618,1767,2058,2191,2191,2393,
%U A224699 2638,2916,3108,3108,3339,3437,3946,4272,4353,4353,5107,5107,5523,5523,5744
%N A224699 a(n) = smallest k such that there is no square between prime(k) and prime(k+n).
%C A224699 The sequence is apparently infinite.
%H A224699 Zak Seidov, <a href="/A224699/b224699.txt">Table of n, a(n) for n = 1..2000</a>
%e A224699 a(2000) = 19907242 because p = prime(19907242) = 371756971, q = prime(19907242 + 2000) = 371795461, and between p anq q there is no square: (19281^2 = 371756961) < p and (19282^2 = 371795524) > q.
%t A224699 m1 = 1; s = {}; Do[Do[If[Ceiling[Sqrt[Prime[m]]]^2 > Prime[m + k], AppendTo[s, m]; m1 = m; Break[]], {m, m1, 10^6}], {k, 60}]; s
%Y A224699 Cf. A221056.
%K A224699 nonn
%O A224699 1,2
%A A224699 _Zak Seidov_, Apr 16 2013