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 A066927 #2 Mar 30 2012 17:30:38
%S A066927 2,2,2,2,3,3,3,4,4,4,4,5,5,5,5,6,6,6,6,6,7,7,7,7,7,8,8,8,8,8,8,9,9,9,
%T A066927 9,9,9,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,12,12,12,12,12,
%U A066927 12,12,12,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,15,15,15,15,15
%N A066927 Least k such that between p and 2p, for all primes > 3, there is always a number that is twice a square, i.e.; a k such that p < 2k^2 < 2p.
%e A066927 a(5) = 3. The 5th prime is 11 and 2p is 22. The theorem says that there exists a number k, between p & 2p that is twice a square. 18 is between 11 & 22 and is of the form 2k^2, k being 3.
%t A066927 Table[ Ceiling[ Sqrt[ Prime[ n ]/2 ] ], {n, 1, 100} ]
%Y A066927 Cf. A006255.
%K A066927 easy,nonn
%O A066927 1,1
%A A066927 _Robert G. Wilson v_, Jan 24 2002