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-2 of 2 results.

A371069 Positions of records in A370998.

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 11, 14, 16, 19, 22, 26, 35, 37, 38, 42, 45, 49, 63, 70, 75, 80, 83, 114, 115, 121, 125, 133, 134, 141, 145, 183, 187, 199, 207, 224, 231, 234, 242, 244, 249, 274, 288, 333, 338, 340, 354, 363, 385, 387, 394, 407, 435, 465
Offset: 1

Views

Author

Hugo Pfoertner, Mar 10 2024

Keywords

Crossrefs

Cf. A239392 (records), A370998.

Formula

A370998(a(n)) = A239392(n).

Extensions

a(39)-a(54) from Martin Ehrenstein, Mar 11 2024

A239392 Numbers n that have record value of prime p such that p + 2n is another prime.

Original entry on oeis.org

1, 3, 11, 44, 56, 101, 359, 664, 821, 866, 2623, 2944, 5171, 12839, 18833, 29947, 38002, 51551, 54206, 90407, 179831, 325681, 436349, 1186739, 3044396, 3821264, 4622276, 6519176, 6795596, 12159494, 17428889, 27538202, 73919371, 127586456, 266466008, 423717053, 458430559
Offset: 1

Views

Author

T. D. Noe, Mar 19 2014

Keywords

Comments

See A101045 of the values of p > 2.

Crossrefs

Cf. A020483 (least p with p, q both prime, such that p+2n = q).

Programs

  • Mathematica
    nn = 10^5; t = Table[j = 1; found = False; While[! found, j++; found = PrimeQ[Prime[j] + 2 i]]; Prime[j], {i, nn}]; mx = -1; t2 = {}; Do[If[t[[i]] > mx, mx = t[[i]]; AppendTo[t2, {i, t[[i]]}]], {i, nn}]; Transpose[t2][[1]]

Formula

a(n) = A370998(A371069(n)). - Hugo Pfoertner, Mar 11 2024

Extensions

a(30)-a(35) from Giovanni Resta, Mar 19 2014
a(36)-a(37) from Hugo Pfoertner, Mar 11 2024
Showing 1-2 of 2 results.