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 A090698 #24 Sep 08 2022 08:45:12
%S A090698 3,19,73,163,883,1153,1459,1801,2179,2593,3529,4051,8713,10369,11251,
%T A090698 15139,17299,18433,19603,20809,22051,30259,34849,36451,46819,48673,
%U A090698 52489,62659,69193,71443,80803,83233,95923,103969,112339,115201,130051
%N A090698 Primes of the form 2*n^2+1.
%C A090698 A prime p can be expressed as either the sum of two squares or the sum of two squares - 1, p = X^2 + Y^2 or p = X^2 + Y^2 - 1, if and only if p is of the form 2*(m^2)+1 where m is either 1 or a multiple of 3.
%C A090698 Conjecture: 2^(a(n)-1) - 3 is not prime. - _Vincenzo Librandi_, Feb 04 2013.
%C A090698 Primes in A058331. - _Vincenzo Librandi_, Apr 10 2015
%H A090698 Vincenzo Librandi, <a href="/A090698/b090698.txt">Table of n, a(n) for n = 1..5000</a>
%F A090698 a(n)=2*A089001(n)^2+1 = A000040(A090612(n)).
%e A090698 19 = 2^2 + 4^2 - 1 = 2*(3^2)+1
%e A090698 73 = 5^2 + 7^2 - 1 = 2*(6^2)+1
%e A090698 163= 8^2 + 10^2 -1 = 2*(9^2)+1
%e A090698 883= 10^2+ 28^2 -1 = 2*(21^2)+1
%t A090698 Select[Table[2n^2+1,{n,0,900}],PrimeQ] (* _Vincenzo Librandi_, Dec 02 2011 *)
%o A090698 (Magma)[a: n in [0..400] | IsPrime(a) where a is 2*n^2+1];// _Vincenzo Librandi_, Dec 02 2011
%o A090698 (PARI) is(n)=isprime(2*n^2+1) \\ _Charles R Greathouse IV_, Jan 05 2013
%Y A090698 Cf. A058331, A089001, A089008, A090612.
%K A090698 nonn,easy
%O A090698 1,1
%A A090698 _Kurmang. Aziz. Rashid_, Dec 20 2003
%E A090698 Extended by _Ray Chandler_, Dec 21 2003