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.

A382227 The smallest perfect cube which is a sum of n consecutive primes.

This page as a plain text file.
%I A382227 #16 Mar 25 2025 10:14:39
%S A382227 8,1331,19248832,205379,10648,531441,195112,15069223,175616,68921,
%T A382227 9261000,389017,97336,531441,17173512,68921,343000,30664297,21952,
%U A382227 253636137,3796416,35611289,8741816,6859,119095488,12167,110592,11930499125,1259712,42508549,373248,4492125,1560896,10793861
%N A382227 The smallest perfect cube which is a sum of n consecutive primes.
%C A382227 a(1) does not exist because no single prime is a perfect cube.
%H A382227 David Dewan, <a href="/A382227/b382227.txt">Table of n, a(n) for n = 2..200</a>
%F A382227 a(n) = A382228(n)^3.
%e A382227 a(2)=8        = 3 + 5.
%e A382227 a(3)=1331     = 439 + 443 + 449.
%e A382227 a(4)=19248832 = 4812191 + 4812193 + 4812209 + 4812239.
%t A382227 a[n_]:=Do[mid=PrimePi[k^3/n]; toTest=Prime[Range[Max[mid-n,1],mid+n]]; t=Total/@Partition[toTest,n,1]; If[MemberQ[t,k^3],Return[k^3]],{k,2,Infinity}]; a/@Range[2, 10]
%Y A382227 Cf. A382226, A382228, A132956.
%K A382227 nonn
%O A382227 2,1
%A A382227 _David Dewan_, Mar 19 2025