|
|
A201473
|
|
Primes of the form 2n^2 + 3.
|
|
2
|
|
|
3, 5, 11, 53, 101, 131, 971, 1061, 1571, 2741, 3203, 3701, 4421, 5003, 6053, 7691, 9803, 13451, 13781, 16931, 19211, 21221, 22901, 24203, 25541, 27851, 31253, 32261, 32771, 35381, 51203, 57803, 61253, 69941, 77621, 81611, 82421
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
LINKS
|
|
|
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
|
|
|
STATUS
|
approved
|
|
|
|