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.

A064402 Numbers n such that prime(n)+n is a prime, where prime(n) denotes the n-th prime number.

This page as a plain text file.
%I A064402 #25 Sep 08 2022 08:45:04
%S A064402 1,2,4,6,18,22,24,26,32,34,42,48,66,70,72,82,92,96,98,100,102,104,106,
%T A064402 108,114,116,126,130,144,150,152,158,172,180,200,202,204,206,218,222,
%U A064402 228,236,270,282,290,300,312,322,324,328,330,350,352,356,362,378,384
%N A064402 Numbers n such that prime(n)+n is a prime, where prime(n) denotes the n-th prime number.
%C A064402 a(n) = order among the primes of A061067(n).
%C A064402 Except for the first one all terms are even. Conjecture: First differences include all even integers. - _Zak Seidov_, Nov 10 2013
%H A064402 Harry J. Smith, <a href="/A064402/b064402.txt">Table of n, a(n) for n=1..1000</a>
%F A064402 a(n) = A061068(n) - A061067(n-1).
%F A064402 A014688(a(n)) = A061068(n). - _Zak Seidov_, Nov 10 2013
%t A064402 Select[ Range[ 400 ], PrimeQ[ Prime[ # ] + # ] & ]
%o A064402 (PARI) { n=0; for (m=1, 10^9, if (isprime(prime(m) + m), write("b064402.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 13 2009
%o A064402 (Magma) [n: n in [0..500]| IsPrime(NthPrime(n) +n)]; // _Vincenzo Librandi_, Apr 06 2011
%Y A064402 Cf. A061067, A061068, A064269.
%K A064402 nonn
%O A064402 1,2
%A A064402 _Robert G. Wilson v_, Sep 28 2001
%E A064402 Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 08 2007