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.

A105409 Numbers k such that prime(k)-2 and prime(k+2)-2 are both primes.

This page as a plain text file.
%I A105409 #12 Oct 04 2024 06:56:13
%S A105409 4,6,27,34,42,44,82,141,143,172,177,235,287,295,314,319,429,459,474,
%T A105409 476,485,578,580,585,672,744,773,863,871,873,892,935,958,1031,1116,
%U A105409 1166,1168,1170,1231,1340,1352,1405,1463,1549,1622,1652,1708,1824,1834,1868
%N A105409 Numbers k such that prime(k)-2 and prime(k+2)-2 are both primes.
%H A105409 Amiram Eldar, <a href="/A105409/b105409.txt">Table of n, a(n) for n = 1..10000</a>
%o A105409 (PARI) pnpk(n, m=2, k=2) = { local(x, v1, v2); for(x=1, n, v1 = prime(x)-k; v2 = prime(x+m)-k; if(isprime(v1)&isprime(v2), print1(x, ", ") ) ) ; } \\ corrected by _Amiram Eldar_, Oct 04 2024
%o A105409 (PARI) lista(pmax) = {my(k = 1, p = primes(4)); forprime(p1 = p[#p], pmax, k++; p[#p] = p1; if(p[2]- p[1] == 2 && p[4] - p[3] == 2, print1(k, ", ")); for(i = 1, #p-1, p[i] = p[i+1]));} \\ _Amiram Eldar_, Oct 04 2024
%Y A105409 Cf. A053778, A105410, A105411, A105412, A105413, A105414.
%K A105409 nonn
%O A105409 1,1
%A A105409 _Cino Hilliard_, May 01 2005
%E A105409 Offset corrected by _Amiram Eldar_, Oct 04 2024