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 A276355 #41 Dec 29 2022 11:22:43 %S A276355 1060,3167,4048,5612,7649,7760,10316,10466,12719,13330,16826,13780, %T A276355 18775,14759,24773,18666,24679,21022,22230,25413,28750,21398,33781, %U A276355 35381,24452,28057,39905,38474,34168,32407,36560,31544,35669,50157,38009,49688,47439,44994 %N A276355 Sum of primes between 100*n and 100*n + 99. %C A276355 The first occurrence of 0 in this sequence is as a(16718). - _Robert Israel_, Dec 28 2022 %H A276355 Robert Israel, <a href="/A276355/b276355.txt">Table of n, a(n) for n = 0..10000</a> %F A276355 a(n) = A034387(100*(n+1)) - A034387(100*n). - _Robert Israel_, Aug 31 2016 %e A276355 Sum of primes in first interval of one hundred numbers: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 is equal to first term i.e 1060. %p A276355 R:= NULL: m:= 0: p:= 0: s:= 0: %p A276355 while m <= 100 do %p A276355 p:= nextprime(p); %p A276355 r:= floor(p/100); %p A276355 if r = m then %p A276355 s:= s + p; %p A276355 else %p A276355 R:= R, s; %p A276355 if m < r-1 then R:= R, 0$(r-1-m) fi; %p A276355 s:= p; %p A276355 m:= r; %p A276355 fi %p A276355 od: %p A276355 R; %t A276355 Table[Total@ Select[Range[#, # + 99] &[100 n], PrimeQ], {n, 0, 37}] (* _Michael De Vlieger_, Sep 01 2016 *) %Y A276355 Cf. A034387, A038822, A181098. %K A276355 nonn,look %O A276355 0,1 %A A276355 _Bhushan Bade_, Aug 31 2016 %E A276355 Definition by _Omar E. Pol_, Aug 31 2016