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.
%I A380319 #9 Jan 20 2025 22:54:29 %S A380319 83,373,1543,2393,4723,10453,0,24953,35323,0,56383,98017,0,122701, %T A380319 238879,0,263723,318181,0,486617,816547,0,874487,817561,0,1130957, %U A380319 1203343,0,3110867,2451637,1789391,1987849,2331379,0,2706679,3124129,0,4260437,4446319,0 %N A380319 Smallest prime that is the sum of 2n+1 squares of consecutive odd primes, or 0 if no such prime exists. %F A380319 If n == 1 (mod 3), either a(n) = 0 or a(n) is the sum of the squares of the primes 3, 5, ..., prime(2*n+2), because p^2 == 1 (mod 3) for all primes p > 3 so the sum of 2*n+1 such primes is divisible by 3. - _Pontus von Brömssen_, Jan 20 2025 %Y A380319 Cf. A001248 (primes squared), A082244 (analog for primes), A379760 (analog for cube of primes). %K A380319 nonn %O A380319 1,1 %A A380319 _Michel Marcus_, Jan 20 2025 %E A380319 Escape clause and more terms added by _Pontus von Brömssen_, Jan 20 2025