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 A070934 #22 Jul 07 2015 11:00:35
%S A070934 2,23,53,197,127,233,691,379,499,857,953,1151,1259,1583,2099,2399,
%T A070934 2417,2579,2909,3803,3821,4217,4651,5107,5813,6829,6079,6599,14153,
%U A070934 10091,8273,10163,9521,12281,13043,11597,12713,13099,16763,15527,16823,22741
%N A070934 Smallest prime equal to the sum of 2n+1 consecutive primes.
%H A070934 T. D. Noe, <a href="/A070934/b070934.txt">Table of n, a(n) for n = 0..10000</a>
%e A070934 Every term of the increasing sequence of primes 127, 401, 439, 479, 593,... is splittable into a sum of 9 consecutive odd primes and 127 = 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 is the least one corresponding to n = 4.
%t A070934 f[n_] := Block[{k = 1, s},While[s = Sum[Prime[i], {i, k, k + 2n}]; !PrimeQ[s], k++ ]; s]; Table[f[n], {n, 0, 41}] (* _Ray Chandler_, Sep 27 2006 *)
%Y A070934 Cf. Bisection of A070281.
%Y A070934 See A082244 for another version.
%Y A070934 Cf. A089793, A215235.
%Y A070934 Cf. A034962, A082246, A082251, A127340, A127341, A161612, A215991-A216020.
%K A070934 nonn
%O A070934 0,1
%A A070934 _Lekraj Beedassy_, May 21 2002
%E A070934 Corrected and extended by _Ray G. Opao_, Aug 26 2004
%E A070934 Entry revised by _Ray Chandler_, Sep 27 2006