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!)
A037036 Least k such that 2^n+1-k is a prime. 0

%I #8 Sep 28 2013 01:35:05

%S 0,0,0,2,0,2,4,2,0,4,4,10,4,2,4,20,0,2,6,2,4,10,4,16,4,40,6,40,58,4,

%T 36,2,6,10,42,32,6,26,46,8,88,22,12,58,18,56,22,116,60,82,28,130,48,

%U 112,34,56,6,14,28,56,94,2,58,26,60,50,6,20,24,20,36,232,94,70,36,98,16,34

%N Least k such that 2^n+1-k is a prime.

%e a(5)=2 because 2^5+1-2=31 that is a prime.

%o (PARI) a(n) = my(k = 0); while (! isprime(2^n+1-k), k++); k; \\ _Michel Marcus_, Sep 28 2013

%Y Cf. A016014.

%K nonn

%O 0,4

%A _Felice Russo_

%E More terms from _Erich Friedman_

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 August 13 14:10 EDT 2024. Contains 375142 sequences. (Running on oeis4.)