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

%I #14 Aug 27 2022 18:25:36

%S 1,1,1,1,1,1806390369,218327374070,3697211121741701604

%N a(n) is the smallest number m such that m^2^k + (m+1)^2^k is prime for k=0..n.

%C The first five terms of this sequence correspond to Fermat primes.

%e 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.

%Y Cf. A090872, A090873, A019434, A000215.

%K nonn,hard,more

%O 0,6

%A _Farideh Firoozbakht_, Feb 06 2004

%E a(6) found by Kellen Shenton added by _Jeppe Stig Nielsen_, Mar 28 2022

%E a(7) from _Kellen Shenton_, Aug 27 2022

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 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)