login
This site is supported by donations to The OEIS Foundation.

 

Logo

110 people attended OEIS-50 (videos, suggestions); annual fundraising drive to start soon (donate); editors, please edit! (stack is over 300), your editing is more valuable than any donation.

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

Table of n, a(n) for n=1..30.

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: A041965 A095075 A069042 * A212276 A000956 A031906

Adjacent sequences:  A121920 A121921 A121922 * A121924 A121925 A121926

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified October 31 05:13 EDT 2014. Contains 248845 sequences.