The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A057192 Least m such that 1 + prime(n)*2^m is a prime, or -1 if no such m exists. 8
 0, 1, 1, 2, 1, 2, 3, 6, 1, 1, 8, 2, 1, 2, 583, 1, 5, 4, 2, 3, 2, 2, 1, 1, 2, 3, 16, 3, 6, 1, 2, 1, 3, 2, 3, 4, 8, 2, 7, 1, 1, 4, 1, 2, 15, 2, 20, 8, 11, 6, 1, 1, 36, 1, 279, 29, 3, 4, 2, 1, 30, 1, 2, 9, 4, 7, 4, 4, 3, 10, 21, 1, 12, 2, 14, 6393, 11, 4, 3, 2, 1, 4, 1, 2, 6, 1, 3, 8, 5, 6, 19, 3, 2, 1, 2, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS Primes p such that p * 2^m + 1 is composite for all m are called Sierpiński numbers. The smallest known prime Sierpiński number is 271129. Currently, 10223 is the smallest prime whose status is unknown. For 0 < k < a(n), prime(n)*2^k is a nontotient. See A005277. - T. D. Noe, Sep 13 2007 With the discovery of the primality of 10223  * 2^31172165 + 1 on November 6, 2016, we now know that 10223 is not a Sierpiński number. The smallest prime of unknown status is thus now 21181. The smallest confirmed instance of a(n) = -1 is for n = 78557. - Alonso del Arte, Dec 16 2016 Aguirre conjectured that, for every n > 1, a(n) is even if and only if prime(n) mod 3 = 1 (see the MathStackExchange link below). - Lorenzo Sauras Altuzarra, Feb 12 2021 REFERENCES See A046067. LINKS T. D. Noe, Table of n, a(n) for n=1..1000 Ray Ballinger and Wilfrid Keller, Sierpiński Problem Timothy Revell, "Crowdsourced prime number could help solve a 50-year-old problem", New Scientist, November 18, 2016. Tejas R. Rao, Effective primality test for p*2^n+1, p prime, n>1, arXiv:1811.06070 [math.NT], 2018. Seventeen or Bust, A Distributed Attack on the Sierpinski problem EXAMPLE a(8) = 6 because prime(8) = 19 and the first prime in the sequence 1 + 19 * {2, 4, 8,1 6, 32, 64} = {39, 77, 153, 305, 609, 1217} is 1217 = 1 + 19 * 2^6. MAPLE a := proc(n)    local m:    m := 0:    while not isprime(1+ithprime(n)*2^m) do m := m+1: od:    m: end: # Lorenzo Sauras Altuzarra, Feb 12 2021 MATHEMATICA Table[p = Prime[n]; k = 0; While[Not[PrimeQ[1 + p * 2^k]], k++]; k, {n, 100}] (* T. D. Noe *) PROG (PARI) a(n) = my(m=0, p=prime(n)); while (!isprime(1+p*2^m), m++); m; \\ Michel Marcus, Feb 12 2021 CROSSREFS Cf. A058887, A058811, A058812, A002202, A014197, A005277, A005384, A005385, A051686. Cf. A046067 (least k such that (2n - 1) * 2^k + 1 is prime). a(n) = -1 if and only if n is in A076336. Sequence in context: A277253 A309494 A132405 * A078777 A135938 A079210 Adjacent sequences:  A057189 A057190 A057191 * A057193 A057194 A057195 KEYWORD sign AUTHOR Labos Elemer, Jan 10 2001 EXTENSIONS Corrected by T. D. Noe, Aug 03 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 19:58 EDT 2021. Contains 344002 sequences. (Running on oeis4.)