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 A179545 #31 Sep 08 2022 08:45:54
%S A179545 3,9,30,63,165,234,408,513,759,1218,1395,1998,2460,2709,3243,4134,
%T A179545 5133,5490,6633,7455,7884,9243,10209,11748,13968,15150,15759,17013,
%U A179545 17658,18984,24003,25545,27948,28773,33078,33975,36738,39609,41583,44634
%N A179545 The sum of the elements within a jump in a Sieve of Eratosthenes table.
%C A179545 Every term in this sequence is a multiple of 3. - _Nathaniel Johnston_, May 04 2011
%H A179545 Nathaniel Johnston, <a href="/A179545/b179545.txt">Table of n, a(n) for n = 1..10000</a>
%F A179545 From _Carl R. White_, Jul 27 2010: (Start)
%F A179545 a(n) = sum(A000040(n)+1 .. 2*A000040(n)-1) = 3*A000040(n)*(A000040(n)-1)/2.
%F A179545 a(n) = sum(p+1 .. 2p-1) = 3p(p-1)/2 where p is the n-th prime. (End)
%F A179545 a(n) = A179628(n)+A108313(n+1). - _R. J. Mathar_, Oct 03 2010
%e A179545 2 (3) = 3 (jumps 3), 3 (4,5) = 9 (jumps 4 and 5), 5 (6,7,8,9) = 30 (jumps 6 through 9), 7 (8,... 13) = 63 (jumps 8 through 13), and so on.
%p A179545 A179545 := proc(n)local k: k:=ithprime(n+1): return 3*k*(k-1)/2: end:
%p A179545 seq(A179545(n),n=0..39); # _Nathaniel Johnston_, Apr 2011
%t A179545 Table[3 Binomial[Prime[n], 2], {n, 1, 60}] (* _Vincenzo Librandi_, Feb 13 2015 *)
%o A179545 (PARI) a(n)=3*binomial(prime(n),2) \\ _Charles R Greathouse IV_, May 19 2011
%o A179545 (PARI) apply(n->3*n*(n-1)/2,primes(1000)) \\ _Charles R Greathouse IV_, May 19 2011
%o A179545 (Magma) [3*Binomial(NthPrime(n), 2): n in [1..40]]; // _Vincenzo Librandi_, Feb 13 2015
%K A179545 nonn,easy
%O A179545 1,1
%A A179545 _Odimar Fabeny_, Jul 19 2010
%E A179545 More terms from _Carl R. White_ and _Odimar Fabeny_, Jul 27 2010