OFFSET
1,1
COMMENTS
a(n) is the sum of the primes in a prime(n) X prime(n) example of Haga's conjecture (see link below).
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
Carlos Rivera, The prime puzzles & problems connection, conjecture 26, The Prime Puzzles and Problems Connection.
FORMULA
a(n) = prime(n)*(prime(n)^2+1)/2, where prime(n) is the n-th prime.
a(n) = A006003(prime(n)). - Michel Marcus, Apr 04 2018
MAPLE
map(t -> t*(t^2+1)/2, [seq(ithprime(i), i=1..100)]); # Robert Israel, Apr 04 2018
MATHEMATICA
a[n_] := Prime[n] (Prime[n]^2 + 1)/2; Table[a[n], {n, 50}]
PROG
(PARI) apply(x->(x*(x^2+1)/2), primes(100)) \\ Michel Marcus, Apr 04 2018
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Enoch Haga, Jan 22 2002
EXTENSIONS
Edited by Dean Hickerson, Jun 08 2002
STATUS
approved