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!)
A090874 a(n) is the smallest number m such that m^2^k + (m+1)^2^k is prime for k=0..n. 3
1, 1, 1, 1, 1, 1806390369, 218327374070, 3697211121741701604 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
The first five terms of this sequence correspond to Fermat primes.
LINKS
EXAMPLE
a(5)=1806390369 because this is the smallest number m such that m^2^k + (m+1)^2^k is prime for k=0,1,2,3,4 and 5.
CROSSREFS
Sequence in context: A129616 A105006 A318788 * A071371 A052094 A256123
KEYWORD
nonn,hard,more
AUTHOR
Farideh Firoozbakht, Feb 06 2004
EXTENSIONS
a(6) found by Kellen Shenton added by Jeppe Stig Nielsen, Mar 28 2022
a(7) from Kellen Shenton, Aug 27 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 April 16 14:17 EDT 2024. Contains 371740 sequences. (Running on oeis4.)