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.

A065762 a(n) = (sum of first n primes)^2 + sum of (squares of first n primes).

This page as a plain text file.
%I A065762 #14 Sep 29 2023 20:52:14
%S A065762 8,38,138,376,992,2058,4030,6956,11556,19038,28958,43536,63052,87218,
%T A065762 118050,158436,210356,271478,347590,438328,542280,667258,812342,
%U A065762 983756,1189396,1423918,1684302,1977696,2300336,2660354,3097234,3582196,4126908,4718214
%N A065762 a(n) = (sum of first n primes)^2 + sum of (squares of first n primes).
%H A065762 Harry J. Smith, <a href="/A065762/b065762.txt">Table of n, a(n) for n = 1..500</a>
%F A065762 a(n) = A007504(n)^2 + A024450(n). - _Michel Marcus_, Oct 12 2015
%e A065762 a(4) = 376 because (2 + 3 + 5 + 7)^2 + (2^2 + 3^2 + 5^2 + 7^2) = 17^2 + (4 + 9 + 25 + 49) = 289 + 87 = 376.
%t A065762 nn=50;With[{prs=Prime[Range[nn]]},Table[Total[Take[prs,n]]^2+ Total[Take[prs,n]^2],{n,nn}]] (* _Harvey P. Dale_, Aug 20 2011 *)
%o A065762 (PARI) { s=ss=0; for (n=1, 500, p=prime(n); s+=p; ss+=p^2; write("b065762.txt", n, " ", s^2 + ss) ) } \\ _Harry J. Smith_, Oct 30 2009
%Y A065762 Cf. A007504, A024450, A065595.
%K A065762 easy,nonn
%O A065762 1,1
%A A065762 _Terrel Trotter, Jr._, Dec 04 2001
%E A065762 More terms from _Harvey P. Dale_, Aug 20 2011