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 A066049 #28 Jul 23 2016 09:24:32
%S A066049 2,3,4,6,7,8,10,11,13,15,17,18,21,22,24,25,28,34,36,38,39,41,42,43,45,
%T A066049 46,49,50,52,56,59,62,63,64,69,73,76,80,81,85,87,91,92,95,98,102,108,
%U A066049 109,112,113,115,118,125,126,127,132,134,137,140,141,143,153,154,155
%N A066049 Numbers n such that 2*n^2 - 1 is a prime.
%C A066049 It is conjectured that this sequence is infinite.
%C A066049 A066436 gives resulting primes p such that (p+1)/2 is square. - _Ray Chandler_
%D A066049 D. Shanks, Solved and Unsolved Problems in Number Theory, 2nd. ed., Chelsea, 1978, p. 31.
%H A066049 T. D. Noe, <a href="/A066049/b066049.txt">Table of n, a(n) for n=1..1000</a>
%F A066049 a(n) = A090697(n)/2 = A110558(n)/4. - _Ray Chandler_, Sep 15 2005
%F A066049 a(n) = A160697(n+1). - _Reinhard Zumkeller_, May 24 2009
%t A066049 Select[Range[200],PrimeQ[2#^2-1]&] (* _Harvey P. Dale_, Jun 14 2011 *)
%o A066049 (PARI) { n=0; for (m=1, 10^9, if (isprime(2*m^2 - 1), write("b066049.txt", n++, " ", m); if (n==1000, return)) ) } \\ _Harry J. Smith_, Nov 08 2009
%Y A066049 Cf. A028870, A066436, A090697, A091176, A110558.
%K A066049 nonn
%O A066049 1,1
%A A066049 _N. J. A. Sloane_, Jan 09 2002
%E A066049 Extended by _Ray Chandler_, Sep 15 2005