cp's OEIS Frontend

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.

A062020 a(n) = Sum_{i=1..n} Sum_{j=1..i} (prime(i) - prime(j)).

This page as a plain text file.
%I A062020 #8 May 14 2022 04:57:26
%S A062020 0,1,6,17,44,81,142,217,324,485,666,913,1208,1529,1906,2373,2936,3533,
%T A062020 4238,5019,5840,6787,7822,8995,10360,11825,13342,14967,16648,18445,
%U A062020 20662,23003,25536,28135,31074,34083,37308,40755,44354,48187,52260
%N A062020 a(n) = Sum_{i=1..n} Sum_{j=1..i} (prime(i) - prime(j)).
%H A062020 G. C. Greubel, <a href="/A062020/b062020.txt">Table of n, a(n) for n = 1..1000</a>
%F A062020 a(n) = a(n-1) + n*prime(n) - Sum_{i = 1..n} prime(i), with a(0) = 0.
%F A062020 a(n) = 2*a(n-1) - a(n-2) + (n-1)*(prime(n) - prime(n-1)), with a(1) = 0, a(2) = 1.
%F A062020 a(n) = Sum_{j=1..n} (2*j - (n+1))*prime(j) = 2*A014285(n) - (n+1)*A007504(n). - _G. C. Greubel_, May 04 2022
%e A062020 a(3) = (5-2) + (5-3) + (3-2) = 6.
%t A062020 a[n_]:= a[n]= If[n<3, (n-1), 2*a[n-1] -a[n-2] +(n-1)*(Prime[n] -Prime[n-1])];
%t A062020 Table[a[n], {n, 50}] (* _G. C. Greubel_, May 04 2022 *)
%o A062020 (SageMath)
%o A062020 @CachedFunction
%o A062020 def a(n): # A062020
%o A062020     if (n<3): return (n-1)
%o A062020     else: return 2*a(n-1) - a(n-2) + (n-1)*(nth_prime(n) - nth_prime(n-1))
%o A062020 [a(n) for n in (1..50)] # _G. C. Greubel_, May 04 2022
%Y A062020 Cf. A000040, A007504, A014285, A062021, A062022.
%K A062020 nonn
%O A062020 1,3
%A A062020 _Amarnath Murthy_, Jun 02 2001
%E A062020 More terms from Larry Reeves (larryr(AT)acm.org), Jun 05 2001
%E A062020 Name edited by _G. C. Greubel_, May 04 2022