|
|
A111041
|
|
Numbers n such that 2*n^2 + 25 is prime.
|
|
0
|
|
|
3, 6, 12, 18, 21, 27, 33, 36, 39, 51, 54, 63, 66, 69, 81, 96, 114, 138, 159, 168, 177, 183, 204, 216, 219, 228, 231, 234, 237, 252, 258, 276, 279, 282, 312, 324, 369, 381, 393, 402, 411, 423, 426, 429, 432, 447, 462, 483, 492, 507, 516, 531, 546, 561, 564, 573
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Necessarily n = 0 (mod 3) because: (a) if n = 3k+1 then 2*n^2 + 25 = 2*(3k+1)^2 + 25 = 2*(9*k^2 + 6*k + 1) + 25 = 18*k^2 + 12*k + 27 = 0 mod 3; (b) if n = 3k-1 then 2*n^2 + 25 = 2*(3k-1)^2 + 25 = 2*(9*k^2 - 6*k + 1) + 25 = 18*k^2 - 12*k + 27 = 0 mod 3; (c) while n = 3k then 2*n^2 + 25 = 2*(3k)^2 + 25 = 18*k^2 + 25 = 1 mod 3, which can be prime. - Jonathan Vos Post, Oct 06 2005
|
|
LINKS
|
|
|
EXAMPLE
|
If n=96 then (2*n^2) + 25 = 18457 (prime).
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|