cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A006560 Smallest starting prime for n consecutive primes in arithmetic progression.

Original entry on oeis.org

2, 2, 3, 251, 9843019, 121174811
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

The primes following a(5) and a(6) occur at a(n)+30*k, k=0..(n-1). a(6) was found by Lander and Parkin. The next term requires a spacing >= 210. The expected size is a(7) > 10^21 (see link). - Hugo Pfoertner, Jun 25 2004
From Daniel Forgues, Jan 17 2011: (Start)
It is conjectured that there are arithmetic progressions of n consecutive primes for any n.
Common differences of first and smallest AP of n >= 1 consecutive primes: {0, 1, 2, 6, 30, 30, >= 210, >= 210, >= 210, >= 210, >= 2310, ...} (End)
a(7) <= 71137654873189893604531, found by P. Zimmermann, cf. J. K. Andersen link. - Bert Dobbelaere, Jul 27 2022

Examples

			First and smallest occurrence of n, n >= 1, consecutive primes in arithmetic progression:
a(1) = 2: (2) (degenerate arithmetic progression);
a(2) = 2: (2, 3) (degenerate arithmetic progression);
a(3) = 3: (3, 5, 7);
a(4) = 251: (251, 257, 263, 269);
a(5) = 9843019: (9843019, 9843049, 9843079, 9843109, 9843139);
a(6) = 121174811: (121174811, 121174841, 121174871, 121174901, 121174931, 121174961);

References

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

Links

Crossrefs

Cf. A005115, A006562, A093364, A126989.
a(5) corresponds to A052243(20) followed by A052243(21) 9843049.
Cf. A089180: indices primes a(n).
Cf. A054800: start of 4 consecutive primes in arithmetic progression (CPAP-4), A033451: start of CPAP-4 with common difference 6, A052239: start of first CPAP-4 with common difference 6n.
Cf. A059044: start of 5 consecutive primes in arithmetic progression, A210727: CPAP-5 with common difference 60.
Cf. A058362: start of 6 consecutive primes in arithmetic progression.

Programs

  • Mathematica
    Join[{2},Table[SelectFirst[Partition[Prime[Range[691*10^4]],n,1], Length[ Union[ Differences[ #]]] == 1&][[1]],{n,2,6}]] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Aug 10 2019 *)

Formula

a(n) = A000040(A089180(n)), or A089180(n) = A000720(a(n)). - M. F. Hasler, Oct 27 2018

Extensions

Edited by Daniel Forgues, Jan 17 2011

A059044 Initial primes of sets of 5 consecutive primes in arithmetic progression.

Original entry on oeis.org

9843019, 37772429, 53868649, 71427757, 78364549, 79080577, 98150021, 99591433, 104436889, 106457509, 111267419, 121174811, 121174841, 168236119, 199450099, 203908891, 207068803, 216618187, 230952859, 234058871, 235524781, 253412317, 263651161, 268843033, 294485363, 296239787
Offset: 1

Views

Author

Harvey Dubner (harvey(AT)dubner.com), Dec 18 2000

Keywords

Comments

Each set has a constant difference of 30, for all of the terms listed so far.
It is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression. As of December 2000, the record is 10 primes.
The first CPAP-5 with common difference 60 starts at 6182296037 ~ 6e9, cf. A210727. This sequence consists of first members of pairs of consecutive primes in A054800 (see also formula): a(1..6) = A054800({1555, 4555, 6123, 7695, 8306, 8371}). Conversely, pairs of consecutive primes in this sequence yield a term of A058362, i.e., they start a sequence of 6 consecutive primes in arithmetic progression (CPAP-6): e.g., the nearby values a(12) = 121174811, a(13) = 121174841 = a(12) + 30 indicate such a term, whence A006560(6) = A058362(1) = a(12). The first CPAP-6 with common difference 60 starts at 293826343073 ~ 3e11, cf. A210727. Longer CPAP's must have common difference >= 210. - M. F. Hasler, Oct 26 2018
About 500 initial terms of this sequence are the same as for the sequence "First of 5 consecutive primes separated by gaps of 30". The first 10^4 terms of A052243 give 281 terms of this sequence (up to ~ 3.34e9) with the same formula as the one using A054800, but as the above comment says, this will miss terms beyond twice that range. - M. F. Hasler, Jan 02 2020

References

  • David Wells, The Penguin Dictionary of Curious and Interesting Numbers (Rev. ed. 1997), p. 181.

Links

Crossrefs

Cf. A054800: start of 4 consecutive primes in arithmetic progression (CPAP-4).
Cf. A033451, A033447, A033448, A052242, A052243, A058252, A058323, A067388: start of CPAP-4 with common difference 6, 12, 18, ..., 48.
Cf. A052239: start of first CPAP-4 with common difference 6n.
Cf. A058362: start of 6 consecutive primes in arithmetic progression.
Cf. A006560: first prime to start a CPAP-n.

Programs

  • Mathematica
    Select[Partition[Prime[Range[14000000]],5,1],Length[Union[ Differences[ #]]]==1&] (* Harvey P. Dale, Jun 22 2013 *)
  • PARI
    A059044(n,p=2,c,g,P)={forprime(q=p+1,, if(p+g!=p+=g=q-p, next, q!=P+2*g, c=3, c++>4, print1(P-2*g,",");n--||break);P=q-g);P-2*g} \\ This does not impose the gap to be 30, but it happens to be the case for the first values. - M. F. Hasler, Oct 26 2018

Formula

Found by exhaustive search for 5 primes in arithmetic progression with all other intermediate numbers being composite.
A059044 = { A054800(i) | A054800(i+1) - A151800(A054800(i)) } with the nextprime function A151800(prime(k)) = prime(k+1) = prime(k) + A001223(k). - M. F. Hasler, Oct 27 2018, edited Jan 02 2020.

Extensions

a(16)-a(22) from Donovan Johnson, Sep 05 2008
Reference added by Harvey P. Dale, Jun 22 2013
Edited (definition clarified, cross-references corrected and extended) by M. F. Hasler, Oct 26 2018

A058362 Initial primes of sets of 6 consecutive primes in arithmetic progression.

Original entry on oeis.org

121174811, 1128318991, 2201579179, 2715239543, 2840465567, 3510848161, 3688067693, 3893783651, 5089850089, 5825680093, 6649068043, 6778294049, 7064865859, 7912975891, 8099786711, 9010802341, 9327115723, 9491161423, 9544001791, 10101930253, 10523406343, 13193702321
Offset: 1

Views

Author

Harvey Dubner (harvey(AT)dubner.com), Dec 18 2000

Keywords

Comments

For all the terms listed so far, the common difference is equal to 30. These are the smallest such sets.
It is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression. As of December 2000 the record is 10 primes.
All terms are congruent to 9 (mod 14). - Zak Seidov, May 03 2017
The first CPAP-6 with common difference 60 starts at 293826343073 ~ 3*10^11, cf. A210727. [With a slope of a(n)/n ~ 5*10^8 this would correspond to n ~ 600.] This sequence consists of first members of pairs of consecutive primes in A059044. Conversely, a pair of consecutive primes in this sequence starts a CPAP-7. This must have a common difference >= 210. As of today, the smallest known CPAP-7 starts at 382003672700092872707633 ~ 3.8*10^23, cf. Andersen link. - M. F. Hasler, Oct 27 2018
The common difference of 60 first occurs at a larger-than-expected prime. The first CPAP-6 with common difference 90 starts at 8560443932347. The first CPAP-6 with common difference 120 starts at 1925601119017087. - Jerry M Lagrou, Jan 01 2024

Links

Crossrefs

Cf. A006560: first prime to start a CPAP-n.
Cf. A033451, A033447, A033448, A052242, A052243, A058252, A058323, A067388: start of CPAP-4 with common difference 6, 12, 18, ..., 48.
Cf. A054800: start of 4 consecutive primes in arithmetic progression (CPAP-4).
Cf. A052239: starting prime of first CPAP-4 with common difference 6n.
Cf. A059044: starting primes of CPAP-5.
Cf. A210727: starting primes of CPAP-5 with common difference 60.

Programs

  • PARI
    p=c=g=P=0;forprime(q=1,, p+g==(p+=g=q-p)|| next; q==P+2*g&& c++|| c=3; c>5&& print1(P-3*g,","); P=q-g) \\ M. F. Hasler, Oct 26 2018

Formula

Equals { A059044(i) | A059044(i+1) = A151800(A059044(i)) }, A151800 = nextprime. - M. F. Hasler, Oct 30 2018

Extensions

Corrected by Jud McCranie, Jan 04 2001
a(11)-a(18) from Donovan Johnson, Sep 05 2008
Comment split off from Name (to clarify definition) by M. F. Hasler, Oct 27 2018
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.