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 A070281 #20 Jun 07 2024 01:45:53
%S A070281 2,5,23,17,53,41,197,0,127,0,233,197,691,281,379,0,499,0,857,0,953,0,
%T A070281 1151,0,1259,0,1583,0,2099,0,2399,0,2417,0,2579,0,2909,0,3803,0,3821,
%U A070281 0,4217,0,4651,0,5107,0,5813,0,6829,0,6079,0,6599,0,14153,0,10091,7699
%N A070281 Smallest prime which is the sum of n consecutive primes, or 0 if no such prime exists.
%C A070281 Sequence A013918 lists the nonzero numbers occurring at even n.
%e A070281 a(60) = 7699 because Sum_{k=1..60} prime(k) = 7699 and 7699 is the smallest possible prime formed by summing 60 consecutive primes. - _Sean A. Irvine_, Jun 07 2024
%t A070281 f[n_] := Block[{k = 1, s},If[Mod[n, 2] == 0,s = Sum[Prime[i], {i, k, k + n - 1}];If[PrimeQ[s], s, 0],While[s = Sum[Prime[i], {i, k, k + n - 1}] ; ! PrimeQ[s], k++ ];s]];Table[f[n], {n, 65}] (* _Ray Chandler_, Sep 27 2006 *)
%Y A070281 Cf. A070934.
%K A070281 nonn
%O A070281 1,1
%A A070281 _Amarnath Murthy_, May 07 2002
%E A070281 Corrected and extended by _Jim Nastos_, Jun 15 2002
%E A070281 Extended by _Ray Chandler_, Sep 27 2006
%E A070281 a(60) corrected by _Giovanni Resta_, May 31 2017
%E A070281 Original a(60) restored by _Sean A. Irvine_, Jun 07 2024