|
|
A131590
|
|
Sum of the squares of the first 2^n primes.
|
|
2
|
|
|
4, 13, 87, 1027, 13275, 155995, 1789395, 19523155, 204330315, 2081006083, 20605602003, 199966727443, 1908356153955, 17942429101363, 166591116531123, 1529578004981731, 13917470067182067, 125565110929591171, 1124685106917162579, 10009134886727192611
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The sum of the squares of the first 2^2 primes is a(2) = 4 + 9 + 25 + 49 = 87.
|
|
PROG
|
(PARI) sumprimesq(n, b) = { local(x, y, s, a); for(y=0, n, s=0; for(x=1, b^y, s+=prime(x)^2; ); print1(s", "); ) }
(PARI) lista(pmax) = {my(s = 0, k = 0, pow = 1); forprime(p = 1, pmax, k++; s += p^2; if(k == pow, print1(s, ", "); pow *= 2)); } \\ Amiram Eldar, Jul 06 2024
(Python)
from sympy import sieve, prime
def a(n): return sum(p*p for p in sieve.primerange(1, prime(2**n)+1))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|