|
Search: id:A121923
|
|
|
| A121923 |
|
a(n) = smallest odd m such that (m^n + (m+2)^n)/2 is prime. |
|
+0
1
|
|
| 2, 17, 37, 4481, 101, 21601, 197, 257, 106921, 401, 237161, 577, 677, 391337974721, 815401, 1054721, 1297, 2093801, 1601, 3122281, 3759713, 6265001, 2917, 3137, 12981601, 16801793, 4357, 5477, 33396833, 2867651480694307162235699968001
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
PROGRAM
|
(PARI) anplusbn(n) = { a=-1; forstep(a=1, n, 2, for(x=1, n, y=(a^x+(a+2)^x)/2; if(ispseudoprime(y), print1(y", "); break; ) ) ) }
|
|
CROSSREFS
|
Adjacent sequences: A121920 A121921 A121922 this_sequence A121924 A121925 A121926
Sequence in context: A041965 A095075 A069042 this_sequence A000956 A031906 A045390
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Sep 10 2006, corrected Nov 15 2006
|
|
|
Search completed in 0.002 seconds
|
