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!)
A126717 Least odd k such that k*2^n-1 is prime. 11

%I #57 Mar 22 2021 03:42:00

%S 3,3,1,1,3,1,3,1,5,7,5,3,5,1,5,9,17,1,3,1,17,7,33,13,39,57,11,21,27,7,

%T 213,1,5,31,3,25,17,21,3,25,107,15,33,3,35,7,23,31,5,19,11,21,65,147,

%U 5,3,33,51,77,45,17,1,53,9,3,67,63,43,63,51,27,73,5,15,21,25,3,55,47,69

%N Least odd k such that k*2^n-1 is prime.

%C If a(n)=1 then n is a Mersenne exponent (A000043). - _Pierre CAMI_, Apr 22 2013

%C From _Pierre CAMI_, Apr 03 2017: (Start)

%C Empirically, as N increases, (Sum_{n=1..N} a(n)) / (Sum_{n=1..N} n) tends to log(2); this is consistent with the prime number theorem as the probability that x*2^n - 1 is prime is ~ 1/(n*log(2)) if n is large enough.

%C For n=1 to 10000, a(n)/n < 7.5.

%C a(n)*2^n - 1 and a(n)*2^n + 1 are twin primes for n = 1, 2, 6, 18, 22, 63, 211, 282, 546, 726, 1032, 1156, 1321, 1553, 2821, 4901, 6634, 8335, 8529; corresponding values of a(n) are 3, 1, 3, 3, 33, 9, 9, 165, 297, 213, 177, 1035, 1065, 291, 6075, 2403, 2565, 4737, 3975, 459. (End)

%H Pierre CAMI, <a href="/A126717/b126717.txt">Table of n, a(n) for n = 0..10000</a> (first 1000 terms from T. D. Noe)

%H Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a>

%H Poo-Sung Park, <a href="https://arxiv.org/abs/2002.09908">Multiplicative functions with f(p + q - n_0) = f(p) + f(q) - f(n_0)</a>, arXiv:2002.09908 [math.NT], 2020.

%F a(n) << 19^n by Xylouris' improvement to Linnik's theorem. - _Charles R Greathouse IV_, Dec 10 2013

%F Conjecture: a(n) = O(n log n). - _Thomas Ordowski_, Oct 15 2014

%e a(10)=5 because 5*2^10-1 is prime but 1*2^10-1 and 3*2^10-1 are not.

%t f[n_] := Block[{k = 1}, While[ !PrimeQ[k*2^n - 1], k += 2]; k]; Table[f@n, {n, 0, 80}] (* _Robert G. Wilson v_, Feb 20 2007 *)

%o (PARI) a(n) = {my(k=1); while(!isprime(k*2^n - 1), k+=2); k}; \\ _Indranil Ghosh_, Apr 03 2017

%o (Python)

%o from sympy import isprime

%o def a(n):

%o k=1

%o while True:

%o if isprime(k*2**n - 1): return k

%o k+=2

%o print([a(n) for n in range(101)]) # _Indranil Ghosh_, Apr 03 2017

%Y Cf. A035050, A057778, A085427, A284631.

%K nonn

%O 0,1

%A _Bernardo Boncompagni_, Feb 13 2007

%E More terms from _Robert G. Wilson v_, Feb 20 2007

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 June 6 11:42 EDT 2024. Contains 373127 sequences. (Running on oeis4.)