The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A302387 a(n) is least number k >= 3 such that (k^(2^n) + (k-2)^(2^n))/2 is prime. 0
3, 3, 3, 5, 3, 3, 3, 179, 169, 935, 663, 8723, 1481, 2035, 10199, 18203, 36395 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Henri Lifchitz & Renaud Lifchitz, (36395^65536+36393^65536)/2, a(16).
EXAMPLE
a(10)=663 corresponds to the prime (663^1024 + 661^1024)/2.
MATHEMATICA
lst = {}; For[n=0, n<=14, n++, k=3; While[! PrimeQ[(k^(2^n) + (k-2)^(2^n))/2], k++]; AppendTo[lst, k]]; lst (* Robert Price, Apr 29 2018 *)
PROG
(PARI) for(n=0, 20, forstep(k=3, +oo, 2, if(ispseudoprime((k^(2^n)+(k-2)^(2^n))/2), print1(k, ", "); break())))
CROSSREFS
Sequence in context: A084742 A242033 A301738 * A049613 A002373 A236569
KEYWORD
nonn,hard,more
AUTHOR
Jeppe Stig Nielsen, Apr 06 2018
EXTENSIONS
a(15) from Robert Price, May 28 2018
a(16) from Kellen Shenton, Apr 14 2022
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 14 04:33 EDT 2024. Contains 372528 sequences. (Running on oeis4.)