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.

A152468 Smallest of five consecutive primes whose sum is a prime.

This page as a plain text file.
%I A152468 #21 Aug 21 2013 02:47:20
%S A152468 5,7,11,13,19,29,31,43,53,59,67,73,79,107,109,113,127,137,149,151,157,
%T A152468 163,179,191,211,223,229,263,269,307,311,349,353,359,379,383,401,409,
%U A152468 419,433,443,449,461,467,479,521,523,541,557,569,571,577,599,613,619
%N A152468 Smallest of five consecutive primes whose sum is a prime.
%C A152468 Surprisingly many terms are also in A073681. - _Zak Seidov_, Dec 17 2012
%H A152468 Zak Seidov, <a href="/A152468/b152468.txt">Table of n, a(n) for n = 1..1000</a>
%t A152468 lst={};Do[p0=Prime[n];p1=Prime[n+1];p2=Prime[n+2];p3=Prime[n+3];p4=Prime[n+4];If[PrimeQ[p=p0+p1+p2+p3+p4],AppendTo[lst,p0]],{n,6!}];lst
%t A152468 Transpose[Select[Partition[Prime[Range[500]], 5, 1], PrimeQ[Total[#]] &]][[1]] (* _Harvey P. Dale_, Jun 05 2013 *)
%t A152468 Prime[Select[Range[150], PrimeQ[Sum[Prime[# + i], {i, 0, 4}]] &]] (* _Bruno Berselli_, Aug 21 2013 *)
%o A152468 (PARI) {a=2; b=3; c=5; d=7; e=11; for(n=1,100, s=a+b+c+d+e;
%o A152468 if(isprime(s), print1(a", ")); a=b; b=c; c=d; d=e; e=nextprime(e+2))} /* _Zak Seidov_, Dec 17 2012 */
%Y A152468 Cf. A073681, A034965, A180948, A189571, A180950, A226380.
%K A152468 nonn
%O A152468 1,1
%A A152468 _Vladimir Joseph Stephan Orlovsky_, Dec 05 2008
%E A152468 More cross references from _Harvey P. Dale_, Jun 05 2013