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!)
A268607 a(n) is the least m > 1 such that 2^n - m is prime. 1

%I #7 Feb 13 2016 03:57:00

%S 2,3,3,3,3,15,5,3,3,9,3,13,3,19,15,9,5,19,3,9,3,15,3,39,5,39,57,3,35,

%T 19,5,9,41,31,5,25,45,7,87,21,11,57,17,55,21,115,59,81,27,129,47,111,

%U 33,55,5,13,27,55,93,31,57,25,59,49,5,19,23,19,35

%N a(n) is the least m > 1 such that 2^n - m is prime.

%C a(1) is not defined (there are no primes less than 2).

%C The definition is similar to Lesser Fortunate numbers (A055211) but uses 2^n instead of primorials A002110(n).

%e a(7)=15 because m=15 is the least m > 1 such that 2^7 - m is prime.

%o (PARI) a(n)=2^n-precprime(2^n-2)

%Y Cf. A005235, A055211, A264050, A263925, A268608.

%K nonn

%O 2,1

%A _Alexei Kourbatov_, Feb 08 2016

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 September 6 06:12 EDT 2024. Contains 375703 sequences. (Running on oeis4.)