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.

A065867 Primes which are the sum of a prime number of consecutive primes.

This page as a plain text file.
%I A065867 #15 Aug 27 2025 08:26:33
%S A065867 5,23,31,41,53,59,67,71,83,97,101,109,131,139,173,181,197,199,211,223,
%T A065867 233,251,263,269,271,281,311,331,349,353,373,401,421,431,439,443,449,
%U A065867 457,463,487,491,499,503,523,563,587,593,607,617,631,647,659,661,677
%N A065867 Primes which are the sum of a prime number of consecutive primes.
%H A065867 Harvey P. Dale, <a href="/A065867/b065867.txt">Table of n, a(n) for n = 1..1000</a>
%e A065867 5 = 2 + 3.
%e A065867 23 = 5 + 7 + 11.
%e A065867 31 = 7 + 11 + 13.
%e A065867 41 = 11 + 13 + 17.
%e A065867 53 = 5 + 7 + 11 + 13 + 17.
%t A065867 lst={};Do[s=Prime[m];k=1;Do[p=Prime[n];s+=p;k++;If[PrimeQ[s]&&PrimeQ[k],If[s<=10837,AppendTo[lst,s]]],{n,m+1,5*5!}],{m,5*5!}];lst=Take[Union@lst,500] (* _Vladimir Joseph Stephan Orlovsky_, Sep 13 2009 *)
%t A065867 Module[{nn=60,prs},prs=Prime[Range[nn]];Take[Select[Union[ Flatten[ Table[ Total/@ Partition[prs,n,1],{n,prs}]]],PrimeQ],nn]] (* _Harvey P. Dale_, Aug 12 2016 *)
%Y A065867 Cf. A001043, A034707, A034962, A034965, A138591, A348790, A348791.
%Y A065867 Cf. A034962 (subsequence).
%K A065867 nonn,changed
%O A065867 1,1
%A A065867 _Henry Bottomley_, Dec 07 2001