login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121923 a(n) = smallest odd m such that (m^n + (m+2)^n)/2 is prime. 0
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; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
PROG
(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
Sequence in context: A294560 A258977 A069042 * A212276 A000956 A031906
KEYWORD
nonn
AUTHOR
Cino Hilliard, Sep 10 2006, corrected Nov 15 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 02:15 EDT 2024. Contains 372317 sequences. (Running on oeis4.)