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-10 of 34 results. Next

A113827 Initial terms associated with the arithmetic progressions of primes in A005115.

Original entry on oeis.org

2, 2, 3, 5, 5, 7, 7, 199, 199, 199, 110437, 110437, 4943, 31385539, 115453391, 53297929, 3430751869, 4808316343, 8297644387, 214861583621, 5749146449311
Offset: 1

Views

Author

N. J. A. Sloane, Jan 24 2006, Oct 17 2007

Keywords

Comments

See A005115 for comments, references, sources, related sequences.

Crossrefs

Cf. A115608-A115613 (number of k-tuples of primes in arithmetic progression less than 10^n).

A093364 Gaps associated with the arithmetic progressions of primes in A005115.

Original entry on oeis.org

0, 1, 2, 6, 6, 30, 150, 210, 210, 210, 13860, 13860, 60060, 420420, 4144140, 9699690, 87297210, 717777060, 4180566390, 18846497670, 26004868890
Offset: 1

Views

Author

Hugo Pfoertner, Apr 27 2004

Keywords

Comments

See A005115 for comments, references, sources, related sequences.

Crossrefs

Extensions

Entry revised by N. J. A. Sloane Jan 26 2006 based on A005115.

A133277 Triangle read by rows: row n gives the arithmetic progression of n primes with minimal final term, cf. A005115.

Original entry on oeis.org

2, 2, 3, 3, 5, 7, 5, 11, 17, 23, 5, 11, 17, 23, 29, 7, 37, 67, 97, 127, 157, 7, 157, 307, 457, 607, 757, 907, 199, 409, 619, 829, 1039, 1249, 1459, 1669, 199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089, 110437, 124297, 138157, 152017, 165877, 179737, 193597, 207457, 221317, 235177, 249037
Offset: 1

Views

Author

N. J. A. Sloane, Oct 17 2007

Keywords

Comments

The first 10 rows (i.e., 55 terms) are the same as for A133276 (where the common distance is minimal), but here T(11,1) = a(56) = 110437 while A133276(11,1) = 60858179. - M. F. Hasler, Jan 02 2020
For any prime p there is a p-AP (arithmetic progression of p primes) starting with p, where the common distance is given by A088430. For n between prime(k-1) and prime(k), there may be an n-AP starting at prime(k) (but not earlier) with a smaller common distance, given in A061558. - M. F. Hasler, Sep 17 2024

Examples

			Triangle begins:
    2;
    2,   3;
    3,   5,   7;
    5,  11,  17,  23;
    5,  11,  17,  23,   29;
    7,  37,  67,  97,  127,  157;
    7, 157, 307, 457,  607,  757,  907;
  199, 409, 619, 829, 1039, 1249, 1459, 1669;
  199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879;
  199, 409, 619, 829, 1039, 1249, 1459, 1669, 1879, 2089;
  ...
		

Crossrefs

For common differences, see A093364. For initial terms, see A113827. For final terms, see A005115.
Differs from A133276 (from T(11,1) = a(56) on).
See also A061558 (distance in earliest n-AP), A088430 (same for primes), A231017 (second term in p-AP starting with p), A061558 (distance of n-AP starting at the smallest possible prime).

Extensions

A-numbers in the Name and Crossrefs sections corrected by Bobby Jacobs, Dec 10 2016
Name edited by M. F. Hasler, Jan 02 2020

A093363 Erroneous version of A005115.

Original entry on oeis.org

1, 2, 3, 7, 23, 29, 157, 1307, 1669, 1879, 2089, 249037, 262897, 725663
Offset: 0

Views

Author

Keywords

References

  • R. K. Guy, Unsolved Problems in Number Theory, A5.

A122764 Initial terms of arithmetic progression of primes in A005115 with duplicates removed.

Original entry on oeis.org

2, 3, 5, 7, 199, 110437, 4943, 31385539, 115453391, 53297929, 3430751869, 4808316343, 8297644387, 214861583621, 5749146449311
Offset: 1

Views

Author

Roger L. Bagula, Sep 22 2006

Keywords

Comments

Old title was: "In A005115 a+b*j: the a term with duplicates removed."
If duplicate terms are not removed, we obtain A113827. - Charlie Neder, Feb 02 2019

Examples

			A005115(7) comes from the 7-term prime progression {7, 157, 307, 457, 607, 757, 907}, and so 7 is in this sequence. - _Charlie Neder_, Feb 02 2019
		

Crossrefs

Programs

  • Mathematica
    a = {{ 1, 2, 2}, {2, 2 + j, 3}, {3, 3 + 2j, 7}, {4, 5 + 6j, 23}, {5, 5 + 6j, 29}, {6, 7 + 30j, 157}, {7, 7 + 150j, 907}, {8, 199 + 210j, 1669}, {9, 199 + 210j, 1879}, {10, 199 + 210j, 2089}, {11, 110437 + 13860j, 249037}, {12, 110437 + 13860j, 262897}}
    Union[Table[CoefficientList[a[[n, 2]], j][[1]], {n, 1, 12}]]

Extensions

Better name and a(7)-a(15) from Charlie Neder, Feb 02 2019

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

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).

Crossrefs

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

A088426 Number of primes in arithmetic progression starting with 19 and with d=2n.

Original entry on oeis.org

1, 2, 1, 1, 2, 3, 1, 1, 2, 1, 2, 3, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 1, 2, 4, 1, 1, 4, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 1, 2, 3, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 4, 1, 2, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1
Offset: 1

Views

Author

Zak Seidov, Sep 29 2003

Keywords

Comments

Arithmetic progression is stopped when next term is not prime. E.g. for n=6 (d=12), a=3, that is 19,31,43 are prime, while next term, 55, is not prime.
From Robert Israel, Jul 27 2020: (Start)
a(n) = 1 if n == 1 (mod 3), a(n) <= 2 if n == 2 (mod 3).
If a(n) >= p where p is 3, 5, 7, 11, 13 or 17, then n is divisible by p.
All a(n) < 19.
Records:
a(1)=1
a(2)=2
a(6)=3
a(27)=4
a(210)=5
a(825)=6
a(16380)=7
a(273420)=9
a(17853675)=10 (End)
From David A. Corneth, Jul 29 2020: (Start)
Other first occurrences are:
a(779520) = 8
a(4918073160) = 11
a(3187366788375) = 12
a(6125952702870) = 13
If a(k) = 14 then k > 4.8*10^15.
If a(k) = 15 then k > 1.77 * 10^16. (End)

Crossrefs

Programs

  • Maple
    f:= proc(n) local d,k;
      d:= 2*n;
      for k from 1 while isprime(19+d*k) do od:
      k
    end proc:
    map(f, [$1..200]); # Robert Israel, Jul 27 2020
  • Mathematica
    bb={}; Do[s=1; Do[If[PrimeQ[19+k*d], s=s+1, bb={bb, s}; Break[]], {k, 10}], {d, 2, 200, 2}]; Flatten[bb]

A376187 For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) for any of these points; a(n) = minimum M(L) over all lines with C(L) = n, or -1 if there is no such line.

Original entry on oeis.org

2, 3, 7, 23, 47, 181, 83, 73, 1069, 521, 701, 1627, 691, 4271, 4261, 3733, 3943, 3929, 10369, 509, 10463, 24683, 10259, 4297, 4159, 34963, 4021, 157907, 24923, 24691, 4027, 162007, 26759, 27283, 164821, 164503, 187721, 164839, 27067, 180437, 27143, 27059, 164663, 27043, 189961
Offset: 1

Views

Author

N. J. A. Sloane, Sep 23 2024

Keywords

Comments

C(L) is the total number of prime points on L, by definition.
This sequence minimizes the largest prime in any line containing n prime-points. For the maximal smallest prime in any line that has the minimal largest prime (i.e. the lines arising in the present sequence), see A376190.
If C(L) = n in the definition is changed to C(L) >= n we get A376188.
Other known values are a(47) = 189887, a(48) = 164707, a(50)-a(58) = [180511, 180463, 26947, 193373, 180289, 180541, 164627, 194083, 186311], a(60) = 193871, a(62)-a(65) = [187471, 194239, 194309, 194141], a(67)-a(70) = [194269, 193723, 193513, 192737], a(76)-a(79) = [194069, 194267, 193789, 193841]. - Max Alekseyev, Sep 27 2024.

Examples

			The following are lines corresponding to a(1) to a(8). We describe the lines by simply listing the primes "prime(k)" corresponding to the points on the line.
  n   L
  1   2
  2   2,3
  3   3,5,7
  4   5,11,17,23
  5   19,23,31,43,47
  6   61,71,101,131,151,181
  7   7,11,59,67,71,79,83
  8   13,17,29,37,41,53,61,73
There are two parallel lines of slope 6 which both contain 20 points. The first contains the points with [x,y] coordinates [45, 197], [51, 233], [52, 239], [54, 251], [55, 257], [56, 263], [57, 269], [64, 311], [71, 353], [72, 359], [76, 383], [77, 389], [79, 401], [86, 443], [87, 449], [89, 461], [92, 479], [94, 491], [96, 503], [97, 509] (here y == -1 mod 6),
and the second contains the points [42, 181], [44, 193], [47, 211], [50, 229], [63, 307], [67, 331], [68,337], [70, 349], [73, 367], [74, 373], [75, 379], [78, 397], [80, 409],[82, 421], [84, 433], [85, 439], [88, 457], [93, 487], [95, 499], [99, 523] (here y == 1 mod 6).
The existence of these two lines was confirmed by _W. Edwin Clark_, who produced the illustration in the LINKS section. This shows an enlargement of the region 35 <= x <= 105. The blue dots are the points on the first line, the red dots those on the second line.
It is interesting to contrast these two 20-point lines with the results in A005115, which gives the earliest arithmetic progressions of primes with a given number of terms. To find an arithmetic progression of 20 primes one has to go out to 572945039351. Of course these primes don't lie on a line, because of the irregular spacing between the primes.
For many further examples of lines containing many prime-points see the Table in the LINKS section.
There are at least five lines of 54 points each and slope 12; and at least 56 lines of 18 points each and slope 12.  There is a 79-point line, connecting (12125,129533)-(17484,193841), again with slope 12. Populous slope-12 lines are common within my search range. - _Don Reble_, Oct 02 2024.
		

Crossrefs

Extensions

a(9) corrected by Rémy Sigrist, Sep 24 2024.
a(12) from W. Edwin Clark, Sep 25 2024.
a(14)-a(45) from Max Alekseyev, Sep 26 2024, and independently confirmed by Don Reble, Oct 02 2024.

A096003 Smallest semiprime (A001358) which is at the end of an arithmetic progression of n semiprimes.

Original entry on oeis.org

4, 6, 14, 46, 58, 221, 445, 497, 1211, 1561, 4195, 4393, 6347, 10717, 14233, 28213, 31451, 72965, 119029, 121603, 124177, 611261, 632171, 2003171, 2012771, 7466993, 7619243, 7771493, 7923743, 68029097, 142247113, 168901739
Offset: 1

Views

Author

N. J. A. Sloane, Jul 28 2004

Keywords

Comments

a(33) <= 1320196303 (gap of 39029760). a(34) <= 1359226063 (gap of 39029760). a(35) <= 1398255823 (gap of 39029760). - Donovan Johnson, Jun 03 2012

Examples

			a(3)=14 since (4,9,14) [or (6,10,14)] is an arithmetic progression of 3 semiprimes ending in 14 and 14 is the smallest semiprime with this property.
		

Crossrefs

Cf. A001358 (semiprimes), A005115 (analog for primes).
For the associated gaps see A097824.

Extensions

More terms from T. D. Noe and Ray Chandler, Jul 29 2004
a(18)-a(20) from Ray Chandler, Aug 01 2004
More terms from Hugo Pfoertner, Aug 27 2004
a(26)-a(30) from Hugo Pfoertner, Sep 07 2004
a(31)-a(32) from Donovan Johnson, Jun 03 2012

A376188 For a line L in the plane, let C(L) denote the number of prime points [k, prime(k)] on L, and let M(L) denote the maximum prime(k) of any of these points; a(n) = minimum M(L) over all lines with C(L) >= n.

Original entry on oeis.org

2, 3, 7, 23, 47, 73, 73, 73, 509, 509, 509, 509, 509, 509, 509, 509, 509, 509, 509, 509, 4021, 4021, 4021, 4021, 4021, 4021, 4021, 4027, 4027, 4027, 4027, 26759, 26759, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947, 26947
Offset: 1

Views

Author

N. J. A. Sloane, Sep 23 2024

Keywords

Comments

To avoid any confusion, C(L) is the total number of prime points on L, by definition.
See A376187 (which considers lines L with C(L) equal to n) for further information.

Crossrefs

Extensions

a(21)-a(52) from Max Alekseyev, Sep 28 2024
Showing 1-10 of 34 results. Next