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.

A173971 Primes p such that 2*p+q is prime, where q is the prime following p.

This page as a plain text file.
%I A173971 #15 Apr 01 2018 11:16:24
%S A173971 2,3,5,13,17,19,29,59,79,103,109,113,149,197,223,227,229,239,241,269,
%T A173971 283,337,349,409,419,439,491,569,577,643,659,691,701,709,739,743,769,
%U A173971 773,787,823,839,911,919,983,1051,1153,1213,1277,1373,1409,1423,1427
%N A173971 Primes p such that 2*p+q is prime, where q is the prime following p.
%C A173971 The resulting primes are in A094104. - _Michel Marcus_, Feb 11 2015
%H A173971 Zak Seidov, <a href="/A173971/b173971.txt">Table of n, a(n) for n = 1..10000</a>
%e A173971 2*2+3=7, 2*3+5=11, 2*5+7=17,..
%t A173971 lst={};Do[p=Prime[n];If[PrimeQ[2*p+Prime[n+1]],AppendTo[lst,p]],{n,6!}];lst
%t A173971 Select[Partition[Prime[Range[300]],2,1],PrimeQ[2#[[1]]+#[[2]]]&][[All,1]] (* _Harvey P. Dale_, Apr 01 2018 *)
%o A173971 (PARI) lista(nn) = {forprime(p=2, nn, if (isprime(2*p+nextprime(p+1)), print1(p, ", ")););} \\ _Michel Marcus_, Feb 11 2015
%Y A173971 Cf. A173970
%K A173971 nonn
%O A173971 1,1
%A A173971 _Vladimir Joseph Stephan Orlovsky_, Mar 03 2010
%E A173971 Definition clarified by _Zak Seidov_, Feb 11 2015