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 A108754 #22 Aug 14 2024 18:32:35
%S A108754 1,1,1,1,3,5,9,13,19,29,39,53,69,85,103,125,151,177,207,239,271,307,
%T A108754 345,387,435,485,535,587,639,693,759,827,899,971,1051,1131,1215,1303,
%U A108754 1393,1487,1585,1683,1789,1895,2003,2111,2229,2357,2487,2617,2749,2885,3021
%N A108754 Difference between partial sum of the first n primes and n^2.
%C A108754 Also difference between partial sum of the first n primes and the sum of the first n odd numbers. - _Cino Hilliard_, Dec 02 2007
%H A108754 Harvey P. Dale, <a href="/A108754/b108754.txt">Table of n, a(n) for n = 1..1000</a>
%F A108754 a(n) = A007504(n) - A000290(n).
%e A108754 a(5) = A007504(5) - A000290(5) = 28 - (5^2) = 3.
%t A108754 Table[ Sum[ Prime[i], {i, n}] - n^2, {n, 53}] (* _Robert G. Wilson v_, Jun 25 2005 *)
%t A108754 Module[{nn=60,prs},prs=Accumulate[Prime[Range[nn]]];#[[1]]-#[[2]]&/@Thread[ {prs,Range[ nn]^2}]] (* _Harvey P. Dale_, Aug 14 2024 *)
%o A108754 (PARI) g(n) = for(x=1,n,y=sum(j=1,x,2*j-1);z=sum(j=1,x,prime(j));print1(z-y",")) \\ _Cino Hilliard_, Dec 02 2007
%Y A108754 Cf. A000290, A007504.
%Y A108754 Partial sums of A131733.
%K A108754 easy,nonn
%O A108754 1,5
%A A108754 _Alexandre Wajnberg_, Jun 23 2005
%E A108754 Edited and extended by _Robert G. Wilson v_, Jun 25 2005