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.

A118071 Primes which are the sum of a twin prime pair + 1.

This page as a plain text file.
%I A118071 #41 May 07 2025 19:35:24
%S A118071 13,37,61,277,397,457,541,1201,1237,1321,1621,1657,2557,2857,3217,
%T A118071 4057,4177,4261,4621,5101,5581,6337,6661,6781,7057,7537,8101,8317,
%U A118071 8461,8521,8677,9277,9601,10837,10957,11317,11701,12541,12601,12721,13381,13921
%N A118071 Primes which are the sum of a twin prime pair + 1.
%H A118071 Amiram Eldar, <a href="/A118071/b118071.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)
%F A118071 {A001359(k) + A006512(k) + 1} INTERSECT {A000040}.
%F A118071 {A054735(k) + 1} INTERSECT {A000040}.
%F A118071 {2*A001359(k) + 3} INTERSECT {A000040}.
%F A118071 {2*A006512(k) - 1} INTERSECT {A000040}. - _Juri-Stepan Gerasimov_, Apr 26 2010
%e A118071 a(1) = 13 = 5 + 7 + 1 where (5,7) is a twin prime pair.
%e A118071 a(2) = 37 = 17 + 19 + 1.
%e A118071 a(3) = 61 = 29 + 31 + 1.
%e A118071 a(4) = 277 = 137 + 139 + 1.
%e A118071 a(5) = 397 = 197 + 199 + 1.
%t A118071 Select[Total/@Select[Partition[Prime[Range[1000]],2,1],#[[2]]-#[[1]] == 2&]+1,PrimeQ] (* _Harvey P. Dale_, Jul 25 2019 *)
%o A118071 (PARI) is(n)=n%12==1 && isprime(n) && isprime(n\2-1) && isprime(n\2+1) \\ _Charles R Greathouse IV_, Jan 21 2015
%Y A118071 Cf. A000040, A001359, A006512, A054735, A038869.
%K A118071 easy,nonn
%O A118071 1,1
%A A118071 _Jonathan Vos Post_, May 11 2006
%E A118071 More terms added by _Vladimir Joseph Stephan Orlovsky_, Mar 10 2009