A064812 -id:A064812 - cp's OEIS frontend

A005603 Smallest prime beginning a complete Cunningham chain (of the second kind) of length n.

11, 7, 2, 2131, 1531, 385591, 16651, 15514861, 857095381, 205528443121, 1389122693971, 216857744866621, 758083947856951, 107588900851484911, 69257563144280941, 3203000719597029781

Offset: 1

N. J. A. Sloane

The chain begins with a prime number p; next term p' (a prime) is produced forming 2p-1; next term p"=2p'-1, etc. "Complete" means that each chain is exactly n primes long (i.e. the chain cannot be a subchain of another one). That is why this sequence is slightly different from A064812, where the 6th term (33301) is smaller than here (385591) but is the second one of a seven primes sequence and therefore doesn't *start* a sequence.

According to Augustin's web site, the numbers 107588900851484911, 69257563144280941, 3203000719597029781 are also in the sequence. - Dmitry Kamenetsky, May 14 2009

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Dirk Augustin, Cunningham Chain records.
C. K. Caldwell, Cunningham chain.
G. Löh, Long chains of nearly doubled primes, Math. Comp., 53 (1989), 751-759.

See A064812 for another version.

Cf. (A005382 and A005383), A057326, A057327, A057328, A057329, A057330, A057331, A005602.

6th term corrected from 385591 on Feb 23 1995, at Robert G. Wilson v's suggestion
a(14) and a(15) found by Paul Jobling (Paul.Jobling(AT)WhiteCross.com) [Oct 23 2000]
a(6) reverted to original value by Sean A. Irvine, Jul 10 2016
a(16) from Augustin's page, comment corrected by Jens Kruse Andersen, Jun 14 2014
Edited by N. J. A. Sloane, Nov 03 2018 at the suggestion of Georg Fischer, Nov 03 2018, merging a duplicate entry with this one.
In Augustin's web page there are 7 or so more terms which could be added here, or alternatively used to create a b-file. - Georg Fischer, Nov 03 2018

A181715 Length of the complete Cunningham chain of the second kind starting with prime(n).

Original entry on oeis.org

3, 2, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1

Offset: 1

M. F. Hasler, Nov 17 2010

nonn

Number of iterations x -> 2x-1 needed to get a composite number, when starting with prime(n).
Dickson's conjecture implies that, for every positive integer r, there exist infinitely many n such that a(n) = r. - Lorenzo Sauras Altuzarra, Feb 12 2021
a(n) is the least k such that 2^k * (prime(n)-1) + 1 is composite. Note that a(n) is well defined since 2^(p-1) * (p-1) + 1 is divisible by p for odd primes p. - Jianing Song, Nov 24 2021

			2 -> 3 -> 5 -> 9 = 3^2, so a(1) = 3 and a(2) = 2. - _Jonathan Sondow_, Oct 30 2015

T. D. Noe, Table of n, a(n) for n = 1..10000
G. Löh, Long chains of nearly doubled primes, Math. Comp., 53 (1989), 751-759.
Michael Penn, Romanian Mathematical Olympiad Problem, Youtube video, 2020.
Wikipedia, Cunningham chain

Cf. A000040, A005382, A005408, A005602, A005603, A181697, A263879, A285700, A285706, A057326, A057327, A057328, A057329, A057330, A064812.

Cf. A137288 (positions of terms > 1).

a := proc(n)
   local c, l:
   c, l := 0, ithprime(n):
   while isprime(l) do c, l := c+1, 2*l-1: od:
   c:
end: # Lorenzo Sauras Altuzarra, Feb 12 2021

Table[p = Prime[n]; cnt = 1; While[p = 2*p - 1; PrimeQ[p], cnt++]; cnt, {n, 100}] (* T. D. Noe, Jul 12 2012 *)
Table[-1 + Length@ NestWhileList[2 # - 1 &, Prime@ n, PrimeQ@ # &], {n, 98}] (* Michael De Vlieger, Apr 26 2017 *)

a(n)= n=prime(n); for(c=1,1e9, is/*pseudo*/prime(n=2*n-1) || return(c))

a(n) < prime(n) for n > 1; see Löh (1989), p. 751. - Jonathan Sondow, Oct 28 2015
max(a(n), A181697(n)) = A263879(n) for n > 2. - Jonathan Sondow, Oct 30 2015
a(n) = A285700(A000040(n)). - Antti Karttunen, Apr 26 2017

Escape clause added to definition by N. J. A. Sloane, Feb 19 2021

Escape clause deleted from definition by Jianing Song, Nov 24 2021

A109998 Non-Cunningham primes: primes isolated from any Cunningham chain under any iteration of 2p+-1 or (p+-1)/2.

Original entry on oeis.org

17, 43, 67, 71, 101, 103, 109, 127, 137, 149, 151, 163, 181, 197, 223, 241, 257, 269, 283, 311, 317, 349, 353, 373, 389, 401, 409, 433, 449, 461, 463, 487, 521, 523, 557, 569, 571, 599, 617, 631, 643, 647, 677, 701, 709, 739, 751, 769, 773, 787, 797, 821

Offset: 1

Alexandre Wajnberg, Sep 01 2005

The condition that neither 2p - 1 nor 2p + 1 be prime is equivalent to ((p-1) mod 3 = 0) or ((p+1) mod 3 = 0). For example, the prime p = 2^607 - 1 is not in this sequence because p + 1 mod 3 = 2. - Washington Bomfim, Oct 30 2009

			a(1) = 17 is here because 17 * 2 + 1 = 35, 17 * 2 - 1 = 33; (17+1)/2 = 9, (17-1)/2 = 8: four composite numbers.

Chris Caldwell's Prime Glossary, Cunningham chains.
Douglas S. Stones, On prime chains, arXiv:0908.2166 [math.NT] [From _Washington Bomfim_, Oct 30 2009, edited by _R. J. Mathar_, Mar 01 2010]

Cf. A005385, A005383, A060254, A005384, A005382, A068497, A059455, A059762, A057326, A023272, A023302, A059764, A057328, A023330, A005602, A064812, A005603.

nonCunninghamPrimes = {}; Do[p = Prime[n]; If[!PrimeQ[2p - 1] && !PrimeQ[2p + 1] && !PrimeQ[(p - 1)/2] && !PrimeQ[(p + 1)/2], AppendTo[nonCunninghamPrimes, p]], {n, 6!}]; nonCunninghamPrimes (* Vladimir Joseph Stephan Orlovsky, Mar 22 2009 *)

Corrected and extended by Ray Chandler, Sep 02 2005

Replaced link to cached arXiv URL with link to the abstract - R. J. Mathar, Mar 01 2010

A379144 a(n) is the number of iterations of the function x --> 2*x - 1 such that x remains prime, starting from A005382(n).

Original entry on oeis.org

2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1

Offset: 1

Ctibor O. Zizka, Dec 16 2024

nonn

Cunningham chain of the second kind of length i is a sequence of prime numbers (p_1, ..., p_i) such that p_(r + 1) = 2*p_r - 1 for all 1 =< r < i. This sequence tells the length of the Cunningham chain of the second kind for primes from A005382.

			n = 1: A005382(1) = 2 --> 3 --> 5 --> 9, 9 is not a prime, thus a(1) = 2.
n = 3: A005382(3) = 7 --> 13 --> 25, 25 is not a prime, thus a(3) = 1.

Cf. A000040, A005382, A005383, A057326, A064812, A110581, A307390.

s[n_] := -2 + Length[NestWhileList[2*# - 1 &, n, PrimeQ[#] &]]; Select[Array[s, 5000], # > 0 &] (* Amiram Eldar, Dec 16 2024 *)

a(A110581(n)) = 1.

a(A057326(n)) = 2.

cp's OEIS Frontend

A005603 Smallest prime beginning a complete Cunningham chain (of the second kind) of length n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A181715 Length of the complete Cunningham chain of the second kind starting with prime(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A109998 Non-Cunningham primes: primes isolated from any Cunningham chain under any iteration of 2p+-1 or (p+-1)/2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A379144 a(n) is the number of iterations of the function x --> 2*x - 1 such that x remains prime, starting from A005382(n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula