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 A201473 #34 Apr 22 2025 02:41:52
%S A201473 3,5,11,53,101,131,971,1061,1571,2741,3203,3701,4421,5003,6053,7691,
%T A201473 9803,13451,13781,16931,19211,21221,22901,24203,25541,27851,31253,
%U A201473 32261,32771,35381,51203,57803,61253,69941,77621,81611,82421,84053,86531,89891,122021,125003
%N A201473 Primes of the form 2*k^2 + 3.
%C A201473 All numbers p satisfying: p = 2*n^2 + 3 such that 2^(n^2 + 1) == 2*n^2 + 2 (mod p). For example: a(5) = 101; 2^50 == 100 (mod 101). - _Alzhekeyev Ascar M_, May 27 2013
%C A201473 Or, primes in A093328. - _Zak Seidov_, Sep 27 2015
%H A201473 Vincenzo Librandi, <a href="/A201473/b201473.txt">Table of n, a(n) for n = 1..5000</a>
%F A201473 a(n) = A093328(A216968(n)). - _Elmo R. Oliveira_, Apr 21 2025
%e A201473 5 is in the sequence since it is a prime and can be expressed as 2*(1^2) + 3.
%e A201473 11 is in the sequence since it is a prime and can be expressed as 2*(2^2) + 3.
%t A201473 Select[Table[2n^2 + 3, {n, 0, 800}], PrimeQ]
%o A201473 (Magma) [a: n in [0..400] | IsPrime(a) where a is 2*n^2+3];
%Y A201473 Cf. A093328, A216968.
%K A201473 nonn,easy
%O A201473 1,1
%A A201473 _Vincenzo Librandi_, Dec 02 2011