A124595 -id:A124595 - cp's OEIS frontend

A126784 Primes p such that q-p = 32, where q is the next prime after p.

5591, 10799, 27701, 27851, 33647, 39047, 41081, 41687, 43721, 44417, 45989, 47459, 50789, 52457, 55259, 55547, 61781, 62351, 64817, 66239, 67307, 69959, 73907, 79907, 80567, 82307, 84089, 88037, 94169, 94961, 99191, 99929, 100559, 102611

Offset: 1

Douglas Winston (douglas.winston(AT)srupc.com), Feb 24 2007

Lower prime of a difference of 32 between consecutive primes.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A001359, A029710, A031924, A031926, A031928, A031930, A031932, A031934, A031936, A031938, A061779, A098974, A124594, A124595, A124596, A000230, A050434.

lista(nn) = {p = 2; while (p < nn, q = nextprime(p+1); if (q - p == 32, print1(p, ", ")); p = q;);} \\ Michel Marcus, Jul 17 2013

A174350 Square array: row n >= 1 lists the primes p for which the next prime is p+2n; read by antidiagonals.

Original entry on oeis.org

3, 5, 7, 11, 13, 23, 17, 19, 31, 89, 29, 37, 47, 359, 139, 41, 43, 53, 389, 181, 199, 59, 67, 61, 401, 241, 211, 113, 71, 79, 73, 449, 283, 467, 293, 1831, 101, 97, 83, 479, 337, 509, 317, 1933, 523, 107, 103, 131, 491, 409, 619, 773, 2113, 1069, 887

Offset: 1

Clark Kimberling, Mar 16 2010

Every odd prime p = prime(i), i > 1, occurs in this array, in row (prime(i+1) - prime(i))/2. Polignac's conjecture states that each row contains an infinite number of indices. In case this does not hold, we can use the convention to continue finite rows with 0's, to ensure the sequence is well defined. - M. F. Hasler, Oct 19 2018

A permutation of the odd primes (A065091). - Robert G. Wilson v, Sep 13 2022

			Upper left hand corner of the array:
     3     5    11    17    29    41    59    71   101 ...
     7    13    19    37    43    67    79    97   103 ...
    23    31    47    53    61    73    83   131   151 ...
    89   359   389   401   449   479   491   683   701 ...
   139   181   241   283   337   409   421   547   577 ...
   199   211   467   509   619   661   797   997  1201 ...
   113   293   317   773   839   863   953  1409  1583 ...
  1831  1933  2113  2221  2251  2593  2803  3121  3373 ...
   523  1069  1259  1381  1759  1913  2161  2503  2861 ...
  (...)
Row 1: p(2) = 3, p(3) = 5, p(5) = 11, p(7) = 17,... these being the primes for which the next prime is 2 greater: (lesser of) twin primes A001359.
Row 2: p(4) = 7, p(6) = 13, p(8) = 19,... these being the primes for which the next prime is 4 greater: (lesser of) cousin primes A029710.

Robert G. Wilson v, Falling antidiagonals 1..115, flattened (first 50 from T. D. Noe).
Fred B. Holt and Helgi Rudd, On Polignac's Conjecture, arxiv:1402.1970 [math.NT], 2014.

Cf. A000040, A001223, A065091, A174349.
Rows 1, 2, 3, ...: A001359, A029710, A031924, A031926, A031928 (row 5), A031930, A031932, A031934, A031936, A031938 (row 10), A061779, A098974, A124594, A124595, A124596 (row 15), A126784, A134116, A134117, A134118, A126721 (row 20), A134120, A134121, A134122, A134123, A134124 (row 25), A204665, A204666, A204667, A204668, A126771 (row 30), A204669, A204670.
Rows 35, 40, 45, 50, ...: A204792, A126722, A204764, A050434 (row 50), A204801, A204672, A204802, A204803, A126724 (row 75), A184984, A204805, A204673, A204806, A204807 (row 100); A224472 (row 150).
Column 1: A000230.
Column 2: A046789.

rows = 10; t2 = {}; Do[t = {}; p = Prime[2]; While[Length[t] < rows - off + 1, nextP = NextPrime[p]; If[nextP - p == 2*off, AppendTo[t, p]]; p = nextP]; AppendTo[t2, t], {off, rows}]; Table[t2[[b, a - b + 1]], {a, rows}, {b, a}] (* T. D. Noe, Feb 11 2014 *)
t[r_, 0] = 2; t[r_, c_] := Block[{p = NextPrime@ t[r, c - 1], q}, q = NextPrime@ p; While[ p + 2r != q, p = q; q = NextPrime@ q]; p]; Table[ t[r - c + 1, c], {r, 10}, {c, r, 1, -1}] (* Robert G. Wilson v, Nov 06 2020 *)

A174350_row(g, N=50, i=0, p=prime(i+1), L=[])={g*=2; forprime(q=1+p, , i++; if(p+g==p=q, L=concat(L, q-g); N--||return(L)))} \\ Returns the first N terms of row g. - M. F. Hasler, Oct 19 2018

a(n) = A000040(A174349(n)). - Michel Marcus, Mar 30 2016

Definition corrected and other edits by M. F. Hasler, Oct 19 2018

A265651 Numbers n such that n-29, n-1, n+1 and n+29 are consecutive primes.

Original entry on oeis.org

14592, 84348, 151938, 208962, 241392, 254490, 397182, 420192, 494442, 527700, 549978, 581982, 637200, 641550, 712602, 729330, 791628, 850302, 975552, 995052, 1086558, 1107852, 1157670, 1245450, 1260798, 1286148, 1494510, 1555290, 1608912

Offset: 1

Karl V. Keller, Jr., Dec 11 2015

nonn

This sequence is a subsequence of A014574 (average of twin prime pairs) and A256753.
The terms ending in 0 are divisible by 30 (cf. A249674).
The terms ending in 2 and 8 are congruent to 12 mod 30 and 18 mod 30 respectively.
The numbers n-29 and n+1 belong to A252090 (p and p+28 are primes) and A124595 (p where p+28 is the next prime).
The numbers n-29 and n-1 belong to A049481 (p and p+30 are primes).

			14592 is the average of the four consecutive primes 14563, 14591, 14593, 14621.
84348 is the average of the four consecutive primes 84319, 84347, 84349, 84377.

Karl V. Keller, Jr., Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Twin Primes

Cf. A014574, A077800 (twin primes), A249674, A256753.

Select[Prime@Range@100000, NextPrime[#, {1, 2, 3}] == {28, 30, 58} + # &] + 29 (* Vincenzo Librandi, Dec 12 2015 *)
Mean/@Select[Partition[Prime[Range[125000]],4,1],Differences[#]=={28,2,28}&] (* Harvey P. Dale, May 02 2016 *)

from sympy import isprime,prevprime,nextprime
for i in range(0,1000001,6):
   if isprime(i-1) and isprime(i+1) and prevprime(i-1) == i-29 and nextprime(i+1) == i+29 :  print (i,end=', ')

A320712 Indices of primes followed by a gap (distance to next larger prime) of 28.

Original entry on oeis.org

429, 462, 685, 781, 1116, 1231, 1274, 1288, 1327, 1392, 1585, 1708, 1710, 1891, 1944, 2065, 2154, 2367, 2417, 2606, 2663, 2729, 2980, 3012, 3069, 3227, 3519, 3653, 3990, 4018, 4168, 4196, 4595, 4603, 4618, 4797, 4856, 4867, 5123, 5191, 5294, 5375, 5432, 5476, 5498, 5593, 5627, 5688, 5703

Offset: 1

M. F. Hasler, Oct 19 2018

nonn

Indices of the primes listed in A124595.

Index entries for primes, gaps between.

Equals A000720 o A124595.
Indices of 28's in A001223.
Row 14 of A174349.
Cf. A029707, A029709, A320701, A320702, ..., A320720 (analog for gaps 2, 4, 6, 8, ..., 44), A116493 (gap 70), A116496 (gap 100), A116497 (gap 200), A116495 (gap 210).

A(N=100,g=28,p=2,i=primepi(p)-1,L=List())={forprime(q=1+p,,i++; if(p+g==p=q, listput(L,i); N--||break));Vec(L)} \\ returns the list of first N terms of the sequence

a(n) = A000720(A124595(n)).

A320712 = { i > 0 | prime(i+1) = prime(i) + 28 }.

cp's OEIS Frontend

A126784 Primes p such that q-p = 32, where q is the next prime after p.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A174350 Square array: row n >= 1 lists the primes p for which the next prime is p+2n; read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A265651 Numbers n such that n-29, n-1, n+1 and n+29 are consecutive primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

A320712 Indices of primes followed by a gap (distance to next larger prime) of 28.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula