A339943 -id:A339943 - cp's OEIS frontend

A337767 Array T(n,k) (n >= 1, k >= 1) read by upward antidiagonals and defined as follows. Let N(p,i) denote the result of applying "nextprime" i times to p; T(n,k) = smallest prime p such that N(p,n) - p = 2*k, or 0 if no such prime exists.

3, 0, 7, 0, 3, 23, 0, 0, 5, 89, 0, 0, 0, 23, 139, 0, 0, 0, 3, 19, 199, 0, 0, 0, 0, 7, 47, 113, 0, 0, 0, 0, 3, 17, 83, 1831, 0, 0, 0, 0, 0, 5, 23, 211, 523, 0, 0, 0, 0, 0, 0, 17, 43, 109, 887, 0, 0, 0, 0, 0, 0, 3, 13, 79, 317, 1129, 0, 0, 0, 0, 0, 0, 0, 7, 19, 107, 619, 1669

Offset: 1

Robert G. Wilson v, Sep 19 2020

The positive entries in each row and column are distinct.
Number of zeros right of 3 are 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 3, 3, 3, 6, 5, 5, 4, 6, ..., .
Number of zeros in the n-th row are 0, 1, 3, 4, 6, 7, 10, 13, 14, 17, 18, 20, 22, 25, 28, 30, 32, 36, 37, 40, 45, 47, 51, 52, 55, ..., .
The usual convention in the OEIS is to use -1 in the "escape clause" - that is, when "no such terms exists". It is probably too late to change this sequence, but it should not be cited as a role model for other sequences. - N. J. A. Sloane, Jan 19 2021
a(1416), a(1637), and a(1753) were provided by Brian Kehrig. - Martin Raab, Jun 28 2024

			The initial rows of the array are:
  3, 7, 23, 89, 139, 199, 113, 1831, 523, 887, 1129, 1669, 2477, 2971, 4297, ...
  0, 3, 5, 23, 19, 47, 83, 211, 109, 317, 619,  199, 1373, 1123, 1627, 4751, ...
  0, 0, 0,  3,  7, 17, 23,  43,  79, 107, 109,  113,  197,  199,  317,  509, ...
  0, 0, 0,  0,  3,  5, 17,  13,  19,  47,  79,   73,  113,  109,  193,  317, ...
  0, 0, 0,  0,  0,  0,  3,   7,  11,  17,  19,   43,   71,   73,  107,  191, ...
  0, 0, 0,  0,  0,  0,  0,   3,   5,  11,   7,   13,   41,   31,   67,  107, ...
  0, 0, 0,  0,  0,  0,  0,   0,   0,   3,   0,    5,   11,   13,   23,   47, ...
  0, 0, 0,  0,  0,  0,  0,   0,   0,   0,   0,    0,    3,    0,    7,   29, ...
  0, 0, 0,  0,  0,  0,  0,   0,   0,   0,   0,    0,    0,    3,    0,    5, ...
The initial antidiagonals are:
  [3]
  [0, 7]
  [0, 3, 23]
  [0, 0, 5, 89]
  [0, 0, 0, 23, 139]
  [0, 0, 0, 3, 19, 199]
  [0, 0, 0, 0, 7, 47, 113]
  [0, 0, 0, 0, 3, 17, 83, 1831]
  [0, 0, 0, 0, 0, 5, 23, 211, 523]
  [0, 0, 0, 0, 0, 0, 17, 43, 109, 887]
  [0, 0, 0, 0, 0, 0, 3, 13, 79, 317, 1129]
  ...

Martin Raab, Table of n, a(n) for n = 1..1830 (antidiagonals 1..60)

Cf. A000230, A144103, A339943, A339944 (rows 1 to 4), A086153.

t[r_, c_] := If[ 2c <= Prime[r + 2] - 5, 0, Block[{p = 3}, While[ NextPrime[p, r] != 2c + p && p < 52000000, p = NextPrime@ p]; If[p > 52000000, 0, p]]]; Table[ t[r -c +1, c], {r, 11}, {c, r}] // Flatten

T(n,k) = 0 if prime(n+2)-5 <= 2k. A089038.

T(n,k) = 3 if prime(n+2) = 2k+6. A067076.

Entry revised by N. J. A. Sloane, Nov 07 2020

Deleted a-file and b-file because entries were unreliable. - N. J. A. Sloane, Nov 01 2021

A339944 Let N(p,i) denote the result of applying "nextprime" i times to p; a(n) = smallest prime p such that N(p,4) - p = 2*n, or -1 if no such prime exists.

Original entry on oeis.org

-1, -1, -1, -1, 3, 5, 17, 13, 19, 47, 79, 73, 113, 109, 193, 317, 313, 521, 503, 523, 887, 1499, 1231, 1319, 1373, 1321, 1307, 3947, 2473, 2143, 2477, 7369, 5573, 5939, 9967, 16111, 18587, 20773, 18593, 31883, 17209, 19597, 24251, 19609, 25471, 31397, 44389, 18803, 38459, 38461, 66191, 69557, 103183

Offset: 1

Robert G. Wilson v, Dec 23 2020

sign

This sequence is the fourth row of A337767.
From Robert G. Wilson v, Dec 30 2020: (Start)
a(n) > -1 for all n >= 5.
It seems likely that for almost all values of n there is more than one integer k such that prime(k+4) - prime(k) = 2*n; a(n) = prime(k) for the smallest such k.
.
   n | list of numbers k such that prime(k+4) - prime(k) = 2*n
  ---+-----------------------------------------------------------------
   5 |  3.
   6 |  5,  7,  11,  97, 101, 1481, 1867, 3457, 5647, 15727, 16057, ...
   7 | 17, 29,  59, 227, 269, 1277, 1289, 1607, 2129,  2789,  3527, ...
   8 | 13, 31,  37,  67, 223, 1087, 1291, 1423, 1483,  1597,  1861, ...
   9 | 19, 23,  41,  43,  53,   61,   71,   89,  149,   163,   179, ...
  10 | 47, 83, 131, 137, 173,  191,  251,  257,  347,   419,   443, ...
etc.
(End)

			a(1) = 3. This represents the beginning of the run of primes {3, 5, 7, 11, 13}. (13 - 3)/2 = 5 and it is the only prime to do so.
a(2) = 5. This represents the beginning of the run of primes {5, 7, 11, 13, 17}. (17 - 5)/2 = 6 and it is the first prime to do so. Others are 7, 11, 97, 101, etc.
a(3) = 17. This represents the beginning of the run of primes {17, 19, 23, 29, 31}. (31 - 17)/2 = 7 and it is the first prime to do so. Others are 29, 59, 227, 269, etc.

Martin Raab, Table of n, a(n) for n = 1..546 (Terms 1..342 from Robert G. Wilson)

Cf. A337767, A000230, A144103, A339943.

p = 3; q = 5; r = 7; s = 11; t = 13; tt[] := 0; While[p < 450000, d = (t - p)/2; If[ tt[d] == 0, tt[d] = p]; {p, q, r, s, t} = {q, r, s, t, NextPrime@ t}]; tt@# & /@ Range@ 75 (* _Robert G. Wilson v, Dec 30 2020 *)

cp's OEIS Frontend

A337767 Array T(n,k) (n >= 1, k >= 1) read by upward antidiagonals and defined as follows. Let N(p,i) denote the result of applying "nextprime" i times to p; T(n,k) = smallest prime p such that N(p,n) - p = 2*k, or 0 if no such prime exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions