|
|
A102166
|
|
Numbers n such that 2*n^2 + 11*n + 101 is prime.
|
|
1
|
|
|
0, 2, 6, 8, 12, 14, 18, 36, 38, 42, 44, 48, 50, 66, 72, 74, 78, 80, 84, 90, 92, 102, 104, 116, 140, 150, 152, 158, 162, 164, 170, 182, 186, 192, 198, 200, 204, 216, 218, 222, 236, 242, 254, 258, 266, 282, 290, 294, 302, 312, 318, 332, 336, 338, 342, 354, 356, 366
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
2 is the smallest one digit prime, 11 is the smallest two digit prime and 101 is the smallest three digit prime.
|
|
LINKS
|
|
|
EXAMPLE
|
For n=0, 2*n^2 + 11*n + 101 = 2*0^2 + 11*0 + 101 = 101 (prime)
for n=48, 2*n^2 + 11*n + 101 = 2*48^2 + 11*48 + 101 = 5237 (prime)
for n=92, 2*n^2 + 11*n + 101 = 2*92^2 + 11*92 + 101 = 18041 (prime)
|
|
MATHEMATICA
|
Select[Range[0, 400], PrimeQ[2#^2+11#+101]&] (* Harvey P. Dale, Aug 16 2020 *)
|
|
PROG
|
(Magma) [n: n in [0..1000] | IsPrime(2*n^2 + 11*n + 101)] // Vincenzo Librandi, Nov 18 2010
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|