OFFSET
1,1
COMMENTS
All numbers p satisfying: p = 2n^2 + 3 such that 2^(n^2 + 1) == 2n^2 + 2 (mod p). For example: a(5) = 101; 2^50 == 100 (mod 101). - Alzhekeyev Ascar M, May 27 2013
Or, primes in A093328. - Zak Seidov, Sep 27 2015
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..5000
EXAMPLE
5 is in the sequence since it is a prime and can be expressed as 2(1^2) + 3.
11 is in the sequence since it is a prime and can be expressed as 2(2^2) + 3.
MATHEMATICA
Select[Table[2n^2 + 3, {n, 0, 800}], PrimeQ]
PROG
(Magma) [a: n in [0..400] | IsPrime(a) where a is 2*n^2+3];
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Dec 02 2011
STATUS
approved