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.

A072666 Numbers n such that prime(n) + prime(n+1) - 1 is prime.

This page as a plain text file.
%I A072666 #22 Sep 08 2022 08:45:06
%S A072666 2,3,4,5,6,8,10,11,13,14,18,19,21,25,30,31,36,41,43,44,46,47,48,50,52,
%T A072666 53,58,59,60,62,63,66,68,70,73,74,75,78,79,80,81,83,85,90,93,99,100,
%U A072666 101,106,112,114,116,117,120,124,126,127,129,130,131,132,137,138,140,145,147,149
%N A072666 Numbers n such that prime(n) + prime(n+1) - 1 is prime.
%H A072666 Vincenzo Librandi, <a href="/A072666/b072666.txt">Table of n, a(n) for n = 1..1000</a>
%F A072666 a(n) = pi(A072667(n)) = A000720(A072667(n)). - _Zak Seidov_, Dec 08 2014
%p A072666 N:= 10^4: # to get all terms n such that prime(n+1) <= N
%p A072666 Primes:= select(isprime,[2,seq(2*i+1,i=1..floor(N/2))]):
%p A072666 PP:= Primes[1..-2]+Primes[2..-1]:
%p A072666 select(t -> isprime(PP[t]-1), [$1..nops(PP)]); # _Robert Israel_, Dec 11 2014
%t A072666 Select[Range[200], PrimeQ[Prime[#]+Prime[#+1]-1] &] (* _Harvey P. Dale_, Dec 16 2010 *)
%o A072666 (Magma) [n: n in [1..200] | IsPrime(NthPrime(n) + NthPrime(n+1)-1)] // _Vincenzo Librandi_, Aug 26 2012
%Y A072666 Cf. A000720, A072667, A072669, A177017.
%K A072666 nonn
%O A072666 1,1
%A A072666 Herman H. Rosenfeld (herm3(AT)pacbell.net), Aug 12 2002
%E A072666 Definition clarified by _Robert Israel_, Dec 11 2014