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.

A376916 Primes that are the sum of some number of consecutive prime squares.

This page as a plain text file.
%I A376916 #10 Oct 09 2024 21:27:12
%S A376916 13,83,373,653,1543,2393,3271,4519,4723,5381,6701,7591,8069,8219,9439,
%T A376916 10453,11719,19541,20269,20477,23599,24821,24953,32939,35323,38219,
%U A376916 39631,41539,45319,51031,53549,55721,56179,56383,56599,56909,65419,69389,73331,74441,75997,81299,87589,89459,90199,93581,96661,97847,98017,107741,108827,109849
%N A376916 Primes that are the sum of some number of consecutive prime squares.
%C A376916 Primes in A340771.
%H A376916 Robert Israel, <a href="/A376916/b376916.txt">Table of n, a(n) for n = 1..10000</a>
%e A376916 a(3) = 373 is a term because 373 is prime and 373 = 3^2 + 5^2 + 7^2 + 11^2 + 13^2 where 3, 5, 6, 11 and 13 are consecutive primes.
%p A376916 N:= 2*10^5: # for terms <= N
%p A376916 PS:= [0, seq(ithprime(i)^2, i=1..numtheory:-pi(floor(sqrt(N))))]:
%p A376916 SPS:= ListTools:-PartialSums(PS):
%p A376916 sort(convert(select(t -> t <= N and isprime(t), {seq(seq(SPS[t]-SPS[s], s=1..t-2), t=2..nops(SPS))}), list);
%Y A376916 Cf. A340771.
%K A376916 nonn
%O A376916 1,1
%A A376916 _Robert Israel_, Oct 09 2024