A059044 -id:A059044 - cp's OEIS frontend

A333254 Lengths of maximal runs in the sequence of prime gaps (A001223).

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

Offset: 1

Gus Wiseman, Mar 20 2020

nonn

Prime gaps are differences between adjacent prime numbers.

Also lengths of maximal arithmetic progressions of consecutive primes.

			The prime gaps split into the following runs: (1), (2,2), (4), (2), (4), (2), (4), (6), (2), (6), (4), (2), (4), (6,6), (2), (6), (4), ...

Robert Israel, Table of n, a(n) for n = 1..10000
Wikipedia, Arithmetic progression
Wikipedia, Longest increasing subsequence

The version for A000002 is A000002. Similarly for A001462.
The unequal version is A333216.
The weakly decreasing version is A333212.
The weakly increasing version is A333215.
The strictly decreasing version is A333252.
The strictly increasing version is A333253.
Positions of first appearances are A335406.
The first term of the first length-n arithmetic progression of consecutive primes is A006560(n), with index A089180(n).
Prime gaps are A001223.
Positions of adjacent equal prime gaps are A064113.
Positions of adjacent unequal prime gaps are A333214.
Cf. A000040, A031217, A054800, A059044, A084758, A090832, A124767, A238279, A295235.

p:= 3: t:= 1: R:= NULL: s:= 1: count:= 0:
for i from 2 while count < 100 do
  q:= nextprime(p);
  g:= q-p; p:= q;
  if g = t then s:= s+1
  else count:= count+1; R:= R, s; t:= g; s:= 1;
  fi
od:
R; # Robert Israel, Jan 06 2021

Length/@Split[Differences[Array[Prime,100]],#1==#2&]//Most

Partial sums are A333214.

A033451 Initial prime in set of 4 consecutive primes with common difference 6.

Original entry on oeis.org

251, 1741, 3301, 5101, 5381, 6311, 6361, 12641, 13451, 14741, 15791, 15901, 17471, 18211, 19471, 23321, 26171, 30091, 30631, 53611, 56081, 62201, 63691, 71341, 75521, 77551, 78791, 80911, 82781, 83431, 84431, 89101, 89381, 91291, 94421

Offset: 1

Jeff Burch

nonn

Primes p such that p, p+6, p+12, p+18 are consecutive primes.
It is conjectured that there exist arbitrarily long sequences of consecutive primes in arithmetic progression. As of March 2013 the record is 10 primes.
Note that the Green and Tao reference is about arithmetic progressions that are not necessarily consecutive. - Michael B. Porter, Mar 05 2013
Subsequence of A023271. - R. J. Mathar, Nov 04 2006
All terms p == 1 (mod 10) and hence p+24 are always divisible by 5. - Zak Seidov, Jun 20 2015
Subsequence of A054800, with which is coincides up to a(24), but a(25) = A054800(26). - M. F. Hasler, Oct 26 2018

			251, 257, 263, 269 are consecutive primes: 257 = 251 + 6, 263 = 251 + 12, 269 = 251 + 18.

T. D. Noe, Table of n, a(n) for n = 1..1000
Jens Kruse Andersen, The Largest Known CPAP's
Ben Green and Terence Tao, The primes contain arbitrarily long arithmetic progressions, arXiv:math/0404188 [math.NT], 2004-2007.
B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Annals of Math. 167(2008), 481-547.
OEIS wiki, Consecutive primes in arithmetic progression: CPAP with given gap, updated Jan. 2020
Index entries for sequences related to primes in arithmetic progressions

Intersection of A054800 and A023271.
Cf. A090832, A090833, A090834, A090835, A090836, A090837, A090838, A090839.
Analogous sequences [with common difference in square brackets]: A033447 [12], A033448 [18], A052242 [24], A052243 [30], A058252 [36], A058323 [42], A067388[48].
Cf. A058362, A059044.
Subsequence of A047948.

N:=10^5: # to get all terms <= N.
Primes:=select(isprime,[seq(i,i=3..N+18,2)]):
Primes[select(t->[Primes[t+1]-Primes[t], Primes[t+2]-Primes[t+1],
Primes[t+3]-Primes[t+2]]=[6,6,6], [$1..nops(Primes)-3])]; # Muniru A Asiru, Aug 04 2017

A033451 = Reap[ For[p = 2, p < 100000, p = NextPrime[p], p2 = NextPrime[p]; If[p2 - p == 6, p3 = NextPrime[p2]; If[p3 - p2 == 6, p4 = NextPrime[p3]; If[p4 - p3 == 6, Sow[p]]]]]][[2, 1]] (* Jean-François Alcover, Jun 28 2012 *)
Transpose[Select[Partition[Prime[Range[16000]],4,1],Union[ Differences[ #]] == {6}&]][[1]] (* Harvey P. Dale, Jun 17 2014 *)

p=2;q=3;r=5;forprime(s=7,1e4,if(s-p==18 && s-q==12 && s-r==6, print1(p", ")); p=q;q=r;r=s) \\ Charles R Greathouse IV, Feb 14 2013

a(n) = A000040(A090832(n)). - Zak Seidov, Jun 20 2015

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

Original entry on oeis.org

2, 2, 3, 251, 9843019, 121174811

Offset: 1

N. J. A. Sloane

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

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

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

Jens Kruse Andersen, The smallest known CPAP-k.
Chris K. Caldwell, Consecutive Primes in Arithmetic Progression
Harvey Dubner and Harry Nelson, Seven consecutive primes in arithmetic progression, Math. Comp., 66 (1997) 1743-1749. MR 98a:11122.
H. Dubner, T. Forbes, N. Lygeros, M. Mizony, H. Nelson, and P. Zimmermann, Ten consecutive primes in arithmetic progression, Math. Comp., Vol. 71, No. 239 (2002) 1323-1328.
Daniel Forgues, Wiki about consecutive primes in arithmetic progression.
L. J. Lander and T. R. Parkin, Consecutive primes in arithmetic progression, Math. Comp., Vol. 21, No. 99 (1967) p 489.
Manfred Toplic, The nine and ten primes project, 2004.
Index entries for sequences related to primes in arithmetic progressions

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.

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

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

Edited by Daniel Forgues, Jan 17 2011

A054819 First term of weak prime quartet: p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).

Original entry on oeis.org

17, 41, 79, 107, 227, 281, 311, 347, 349, 379, 397, 439, 461, 499, 569, 641, 673, 677, 827, 857, 881, 907, 1031, 1061, 1091, 1187, 1229, 1277, 1301, 1319, 1367, 1427, 1429, 1451, 1487, 1489, 1549, 1607, 1619, 1621, 1697, 1877, 1997, 2027, 2087, 2153

Offset: 1

Henry Bottomley, Apr 10 2000

nonn

			From _Gus Wiseman_, May 31 2020: (Start)
The first 10 strictly increasing prime gap quartets:
   17   19   23   29
   41   43   47   53
   79   83   89   97
  107  109  113  127
  227  229  233  239
  281  283  293  307
  311  313  317  331
  347  349  353  359
  349  353  359  367
  379  383  389  397
(End)

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Cf. A051635, A054800-A054840.
Prime gaps are A001223.
Second prime gaps are A036263.
Strictly decreasing prime gap quartets are A335278.
Strictly increasing prime gap quartets are A335277.
Equal prime gap quartets are A090832.
Weakly increasing prime gap quartets are A333383.
Weakly decreasing prime gap quartets are A333488.
Unequal prime gap quartets are A333490.
Partially unequal prime gap quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Lengths of maximal weakly decreasing sequences of prime gaps are A333212.
Lengths of maximal strictly increasing sequences of prime gaps are A333253.
Cf. A000040, A006560, A031217, A059044, A084758, A089180, A333253.

wpqQ[lst_]:=Module[{diffs=Differences[lst]},diffs[[1]]Harvey P. Dale, Jun 12 2012 *)
ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-xx] (* Gus Wiseman, May 31 2020 *)

a(n) = prime(A335277(n)). - Gus Wiseman, May 31 2020

A054804 First term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).

Original entry on oeis.org

31, 61, 89, 211, 271, 293, 449, 467, 607, 619, 709, 743, 839, 863, 919, 1069, 1291, 1409, 1439, 1459, 1531, 1637, 1657, 1669, 1723, 1759, 1777, 1831, 1847, 1861, 1979, 1987, 2039, 2131, 2311, 2357, 2371, 2447, 2459, 2477, 2503, 2521, 2557, 2593, 2633

Offset: 1

Henry Bottomley, Apr 10 2000

nonn

Primes preceding the first member of pairs of consecutive primes in A051634 ("strong primes"), see example. (A051634 lists the middle member of the triplets, here we list the first member of the quadruplets.) - M. F. Hasler, Oct 27 2018, corrected thanks to Gus Wiseman, Jun 01 2020.

			The first 10 strictly decreasing prime gap quartets:
   31  37  41  43
   61  67  71  73
   89  97 101 103
  211 223 227 229
  271 277 281 283
  293 307 311 313
  449 457 461 463
  467 479 487 491
  607 613 617 619
  619 631 641 643
For example, the primes (211,223,227,229) have differences (12,4,2), which are strictly decreasing, so 211 is in the sequence.
The second and third term of each quadruplet are consecutive terms in A051634: this is a characteristic property of this sequence. - _M. F. Hasler_, Jun 01 2020

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A051634, A054800-A054840.
Prime gaps are A001223.
Second prime gaps are A036263.
All of the following use prime indices rather than the primes themselves:
- Strictly decreasing prime gap quartets are A335278.
- Strictly increasing prime gap quartets are A335277.
- Equal prime gap quartets are A090832.
- Weakly increasing prime gap quartets are A333383.
- Weakly decreasing prime gap quartets are A333488.
- Unequal prime gap quartets are A333490.
- Partially unequal prime gap quartets are A333491.
- Adjacent equal prime gaps are A064113.
- Strict ascents in prime gaps are A258025.
- Strict descents in prime gaps are A258026.
- Adjacent unequal prime gaps are A333214.
- Weak ascents in prime gaps are A333230.
- Weak descents in prime gaps are A333231.
Maximal weakly increasing intervals of prime gaps are A333215.
Maximal strictly decreasing intervals of prime gaps are A333252.
Cf. also A000040, A006560, A031217, A054800, A054805, A054806, A054807, A059044, A084758, A089180, A333253, A335278.

primes:= select(isprime,[seq(i,i=3..10000,2)]):
L:=  primes[2..-1]-primes[1..-2]:
primes[select(t -> L[t+2] < L[t+1] and L[t+1] < L[t], [$1..nops(L)-2])]; # Robert Israel, Jun 28 2018

ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x>z-y>t-z:>x] (* Gus Wiseman, May 31 2020 *)
Select[Partition[Prime[Range[400]],4,1],Max[Differences[#,2]]<0&][[All,1]] (* Harvey P. Dale, Jan 12 2023 *)

a(n) = prime(A335278(n)). - Gus Wiseman, May 31 2020

A052243 Initial prime in set of (at least) 4 consecutive primes in arithmetic progression with difference 30.

Original entry on oeis.org

642427, 1058861, 3431903, 4176587, 4560121, 4721047, 5072269, 5145403, 5669099, 5893141, 6248969, 6285047, 6503179, 6682969, 8545357, 8776121, 8778739, 9490571, 9836227, 9843019, 9843049, 10023787, 11697979, 12057919, 12340313, 12687119, 12794641, 12845849

Offset: 1

Labos Elemer, Jan 31 2000

nonn

Primes p such that p, p+30, p+60, p+90 are consecutive primes.

The analogous sequence for a CPAP-5 (at least five consecutive primes in arithmetic progression) with gap 30 does not have its own entry in the OEIS, but for over 500 terms it is identical to A059044. The CPAP-6 analog is A058362. - M. F. Hasler, Jan 02 2020

			642427, 642457, 642487, 642517 are consecutive primes, so 642427 is in the sequence.

Chai Wah Wu, Table of n, a(n) for n = 1..10000 (terms n = 1..200 from M. F. Hasler)
OEIS wiki, Consecutive primes in arithmetic progression: CPAP with given gap, updated Jan. 2020.
Index entries for sequences related to primes in arithmetic progressions

Analogous sequences (start of CPAP-4 with common difference in square brackets): A033451 [6], A033447 [12], A033448 [18], A052242 [24], A052243 [this: 30], A058252 [36], A058323 [42], A067388 [48], A259224 [54], A210683 [60].
Subsequence of A052195 and of A054800 (start of CPAP-4 with any common difference).
See also A059044 (start of CPAP-5), A058362 (CPAP-6).

f:=func; a:=[]; for p in PrimesInInterval(2,13000000) do if  (f(p)-p eq 30) and (f(f(p))-p eq 60) and (f(f(f(p)))-p eq 90) then Append(~a,p); end if; end for; a; // Marius A. Burtea, Jan 04 2020

p := 2 : q := 3 : r := 5 : s := 7 : for i from 1 do if q-p = 30 and r-q=30 and s-r=30 then printf("%d,\n",p) ; fi ; p := q ; q := r ; r := s ; s := nextprime(r) ; od: # R. J. Mathar, Apr 12 2008

p=2; q=3; r=5; s=7; A052243 = Reap[For[i=1, i<1000000, i++, If[ q-p == 30 && r-q == 30 && s-r == 30 , Print[p]; Sow[p]]; p=q; q=r; r=s; s=NextPrime[r]]][[2, 1]] (* Jean-François Alcover, Jun 28 2012, after R. J. Mathar *)
Transpose[Select[Partition[Prime[Range[1100000]],4,1],Union[ Differences[#]] =={30}&]][[1]] (* Harvey P. Dale, Jun 17 2014 *)

A052243(n,p=2,print_all=0,g=30,c,o)={forprime(q=p+1,,if(p+g!=p=q, next, q!=o+2*g, c=2, c++>3, print_all&& print1(o-g","); n--||break); o=q-g);o-g} \\ optional 2nd arg specifies starting point, allows to define:
next_A052243(p)=A052243(1,p+1) \\ replacing older code from 2008. - M. F. Hasler, Oct 26 2018

A052243 = { A052195(n) | A052195(n+1) = A052195(n) + 30 }. - M. F. Hasler, Jan 02 2020

More terms from Harvey P. Dale, Nov 19 2000

Edited by N. J. A. Sloane, Apr 28 2008, at the suggestion of R. J. Mathar

A333383 First index of weakly increasing prime quartets.

Original entry on oeis.org

1, 2, 7, 13, 14, 22, 28, 35, 38, 45, 49, 54, 60, 64, 69, 70, 75, 78, 85, 89, 95, 104, 109, 116, 117, 122, 123, 144, 148, 152, 155, 159, 160, 163, 164, 173, 178, 182, 183, 184, 187, 194, 195, 198, 201, 206, 212, 215, 218, 219, 225, 226, 230, 236, 237, 238, 244

Offset: 1

Gus Wiseman, May 14 2020

nonn

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) <= g(k + 1) <= g(k + 2).

			The first 10 weakly increasing prime quartets:
    2   3   5   7
    3   5   7  11
   17  19  23  29
   41  43  47  53
   43  47  53  59
   79  83  89  97
  107 109 113 127
  149 151 157 163
  163 167 173 179
  197 199 211 223
For example, 43 is the 14th prime, and the primes (43,47,53,59) have differences (4,6,6), which are weakly increasing, so 14 is in the sequence.

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly decreasing prime quartets are A054804.
Strictly increasing prime quartets are A054819.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383 (this sequence).
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Indices of weakly increasing rows of A066099 are A225620.
Lengths of maximal weakly increasing subsequences of prime gaps: A333215.
Lengths of maximal strictly decreasing subsequences of prime gaps: A333252.
Cf. A000040, A006560, A031217, A054800, A059044, A084758, A089180, A333253.

ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x<=z-y<=t-z:>PrimePi[x]]

A333490 First index of unequal prime quartets.

Original entry on oeis.org

7, 8, 10, 11, 13, 17, 18, 19, 20, 22, 23, 24, 28, 30, 31, 32, 34, 40, 42, 44, 47, 49, 50, 51, 52, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 75, 76, 78, 79, 82, 83, 85, 86, 87, 89, 90, 91, 94, 95, 96, 97, 98, 99, 104, 111, 112, 113, 114, 115, 116, 119

Offset: 1

Gus Wiseman, May 15 2020

nonn

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k), g(k + 1), and g(k + 2) are all different.

			The first 10 unequal prime quartets:
  17  19  23  29
  19  23  29  31
  29  31  37  41
  31  37  41  43
  41  43  47  53
  59  61  67  71
  61  67  71  73
  67  71  73  79
  71  73  79  83
  79  83  89  97
For example, 83 is the 23rd prime, and the primes (83,89,97,101) have differences (6,8,4), which are all distinct, so 23 is in the sequence.

Primes are A000040.
Prime gaps are A001223.
Second prime gaps are A036263.
Indices of unequal rows of A066099 are A233564.
Lengths of maximal anti-run subsequences of prime gaps are A333216.
Lengths of maximal runs of prime gaps are A333254.
Maximal anti-runs in standard compositions are counted by A333381.
Indices of anti-run rows of A066099 are A333489.
Strictly decreasing prime quartets are A054804.
Strictly increasing prime quartets are A054819.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490 (this sequence).
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Cf. A006560, A031217, A054800, A059044, A084758, A089180, A124767, A333215.

ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x!=z-y!=t-z:>PrimePi[x]]

A333491 First index of partially unequal prime quartets.

Original entry on oeis.org

3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 37, 40, 41, 42, 43, 44, 47, 48, 49, 50, 51, 52, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 74, 75, 76, 77, 78, 79, 80, 81, 82

Offset: 1

Gus Wiseman, May 15 2020

nonn

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) != g(k + 1) != g(k + 2), but we may have g(k) = g(k + 2).

			The first 10 partially unequal prime quartets:
   5  7 11 13
   7 11 13 17
  11 13 17 19
  13 17 19 23
  17 19 23 29
  19 23 29 31
  23 29 31 37
  29 31 37 41
  31 37 41 43
  37 41 43 47

Primes are A000040.
Prime gaps are A001223.
Second prime gaps are A036263.
Indices of unequal rows of A066099 are A233564.
Lengths of maximal anti-runs of prime gaps are A333216.
Lengths of maximal runs of prime gaps are A333254.
Maximal anti-runs in standard compositions are counted by A333381.
Indices of anti-run rows of A066099 are A333489.
Strictly decreasing prime quartets are A054804.
Strictly increasing prime quartets are A054819.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491 (this sequence).
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Cf. A006560, A031217, A054800, A059044, A084758, A089180, A124767, A333215.

ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x!=z-y&&z-y!=t-z:>PrimePi[x]]
PrimePi[#]&/@(Select[Partition[Prime[Range[90]],4,1],#[[2]]-#[[1]]!=#[[3]]-#[[2]]&&#[[3]]-#[[2]]!=#[[4]]-#[[3]]&][[;;,1]]) (* Harvey P. Dale, Aug 05 2025 *)

A333488 First index of weakly decreasing prime quartets.

Original entry on oeis.org

11, 15, 18, 24, 36, 39, 46, 47, 53, 54, 55, 58, 62, 72, 73, 87, 91, 101, 102, 106, 107, 110, 111, 114, 118, 127, 128, 129, 132, 146, 150, 157, 180, 186, 193, 199, 210, 217, 223, 228, 232, 239, 242, 259, 260, 263, 269, 270, 271, 274, 275, 282, 283, 284, 290

Offset: 1

Gus Wiseman, May 15 2020

nonn

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) >= g(k + 1) >= g(k + 2).

			The first 10 weakly decreasing prime quartets:
   31  37  41  43
   47  53  59  61
   61  67  71  73
   89  97 101 103
  151 157 163 167
  167 173 179 181
  199 211 223 227
  211 223 227 229
  241 251 257 263
  251 257 263 269
For example, 241 is the 53rd prime, and the primes (241,251,257,263) have differences (10,6,6), which are weakly decreasing, so 53 is in the sequence.

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly decreasing prime quartets are A054804.
Strictly increasing prime quartets are A054819.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488 (this sequence).
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Indices of weakly decreasing rows of A066099 are A114994.
Lengths of maximal weakly decreasing subsequences of prime gaps: A333212.
Lengths of maximal strictly increasing subsequences of prime gaps: A333253.
Cf. A000040, A006560, A031217, A054800, A059044, A084758, A089180.

ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x>=z-y>=t-z:>PrimePi[x]]

cp's OEIS Frontend

A333254 Lengths of maximal runs in the sequence of prime gaps (A001223).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A033451 Initial prime in set of 4 consecutive primes with common difference 6.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A054819 First term of weak prime quartet: p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A054804 First term of strong prime quartets: prime(m+1)-prime(m) > prime(m+2)-prime(m+1) > prime(m+3)-prime(m+2).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A052243 Initial prime in set of (at least) 4 consecutive primes in arithmetic progression with difference 30.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A333383 First index of weakly increasing prime quartets.

Views

Author

Keywords