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.

A174915 Numbers p such that p, q=p+2 and p+2*q are all primes.

This page as a plain text file.
%I A174915 #19 Sep 08 2022 08:45:51
%S A174915 3,5,11,41,59,101,179,191,269,311,431,521,599,821,881,1019,1061,1151,
%T A174915 1229,1301,1451,1481,1619,1721,1949,2081,2111,2141,2729,2999,3299,
%U A174915 3821,4001,4091,4259,4421,4799,4931,5009,5519,5639,5849,6131,6359,6689,6701
%N A174915 Numbers p such that p, q=p+2 and p+2*q are all primes.
%C A174915 Subsequence of A175914.
%H A174915 Zak Seidov, <a href="/A174915/b174915.txt">Table of n, a(n) for n = 1..1000</a>
%t A174915 lst={};Do[p1=Prime[n];p2=p1+2;If[PrimeQ[p2]&&PrimeQ[p1+2*p2],AppendTo[lst,p1]],{n,7!}];lst
%t A174915 Reap[Do[p = Prime[m]; If[PrimeQ[p + 2 ] && PrimeQ[3 p + 4], Sow[p]], {m, 10^3}]][[2, 1]](* _Zak Seidov_, Oct 14 2012 *)
%t A174915 Transpose[Select[Partition[Prime[Range[1000]],2,1],#[[2]]-#[[1]]==2 && PrimeQ[ #[[1]]+2#[[2]]]&]][[1]] (* _Harvey P. Dale_, Jan 28 2015 *)
%o A174915 (PARI) forprime(p=2,7000,q=p+2;if(isprime(q)&& isprime(p+2*q),print1(p,", ")))
%o A174915 (Magma) [p: p in PrimesUpTo(7000) | IsPrime(p+2) and IsPrime(3*p+4)]; // _Vincenzo Librandi_, Jan 29 2015
%Y A174915 Cf. A001359, A174913, A175914.
%K A174915 nonn
%O A174915 1,1
%A A174915 _Vladimir Joseph Stephan Orlovsky_, Apr 02 2010
%E A174915 Definition and comment corrected by _Zak Seidov_, Dec 06 2010