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 A132810 #15 Jan 17 2023 16:34:15
%S A132810 3,8,15,36,395,72,119,240,2349,300,539,276,923,714,435,496,629,702,
%T A132810 2375,1120,1995,1144,3979,3192,3925,2938,9531,1960,10063,2670,3441,
%U A132810 4448,5907,6358,9835,4464,5069,3610,13533,4000,6273,4410,21113,12012,8325,8142
%N A132810 Smallest sum of n consecutive odd primes which is a multiple of n.
%H A132810 Zak Seidov, <a href="/A132810/b132810.txt">Table of n, a(n) for n = 1..1000</a>
%F A132810 Let A132809(n)=prime(i). Then a(n)= sum(j=i...i+n-1) prime(j). - _R. J. Mathar_, Nov 27 2007
%e A132810 a(5)=395, associated with A132809(5)=71=prime(20) as the first of the 5 consecutive primes, is the smallest sum of 5 consecutive odd primes which is divisible by n=5.
%t A132810 Table[Module[{nn=n,ncop},ncop=Total/@Partition[Prime[Range[2,2500]],nn,1];SelectFirst[ ncop,Mod[#,nn]==0&]],{n,50}] (* _Harvey P. Dale_, Jan 17 2023 *)
%Y A132810 Cf. A132809, A132811.
%K A132810 easy,nonn
%O A132810 1,1
%A A132810 _Enoch Haga_, Sep 01 2007
%E A132810 The example does not match the sequence. Also the offset for all of this bunch of sequences should probably be 1. - _N. J. A. Sloane_, Sep 13 2007
%E A132810 Edited by _R. J. Mathar_, Nov 27 2007