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.

A293620 Numbers k such that f(k), f(k+1) and f(k+2) are all primes, where f(k) = (2k+1)^2 - 2 (A073577).

Original entry on oeis.org

1, 2, 16, 58, 149, 177, 534, 681, 954, 1045, 1052, 1255, 1367, 1563, 2046, 2074, 2515, 2557, 2564, 2788, 3586, 3593, 3908, 4062, 4552, 5252, 5371, 5385, 6400, 6729, 7443, 7478, 9305, 9375, 9942, 10355, 10411, 10726, 10740, 11286, 11545, 11559, 11832, 11965
Offset: 1

Views

Author

Amiram Eldar, Oct 13 2017

Keywords

Comments

Sierpiński proved that under Schinzel's hypothesis H this sequence is infinite.
Sierpiński showed that the only quadruple of consecutive primes of the form (2k+1)^2 - 2 are for k = 1 (i.e., 1 and 2 are the only consecutive terms in this sequence).
Numbers k such that the 3 consecutive integers k, k+1 and k+2 belong to A088572. - Michel Marcus, Oct 13 2017

Examples

			The first triples are: k = 1: (7, 23, 47), k = 2: (23, 47, 79), k = 16: (1087, 1223, 1367).
		

Crossrefs

Programs

  • Mathematica
    Select[Range[10^4], AllTrue[{(2#+1)^2-2, (2#+3)^2-2, (2#+5)^2-2},PrimeQ] &]
    SequencePosition[Table[If[PrimeQ[(2k+1)^2-2],1,0],{k,12000}],{1,1,1}][[;;,1]] (* Harvey P. Dale, Feb 09 2025 *)
  • PARI
    f(n) = 4*n^2 + 4*n - 1;
    isok(n) = isprime(f(n)) && isprime(f(n+1)) && isprime(f(n+2)); \\ Michel Marcus, Oct 13 2017