|
%I #28 Jun 17 2022 16:05:47
%S 4,31,3156,826699,285312497310,303160419089563,827240565046755853740,
%T 1979246896225360344977719,20880469979094808259715377888286,
%U 2567686153182091604540923022990731504371755
%N a(n) = Sum_{k=1..n} prime(k)^prime(k).
%H Harry J. Smith, <a href="/A061789/b061789.txt">Table of n, a(n) for n = 1..76</a>
%F Partial sums of A051674. - _R. J. Mathar_, Apr 26 2007
%e a(3) = 2^2 + 3^3 + 5^5 = 3156.
%t P3[n_] := Sum[Prime[i]^Prime[i], {i, 1, n}]; Table[P3[n], {n, 1, 10}] (* _Vladimir Joseph Stephan Orlovsky_, Apr 29 2008 *)
%t Accumulate[#^#&/@Prime[Range[10]]] (* _Harvey P. Dale_, Apr 10 2015 *)
%o (PARI) a=n=0; forprime (p=2, 383, write("b061789.txt", n++, " ", a+=p^p)) \\ _Harry J. Smith_, Jul 28 2009
%o (Python)
%o from itertools import accumulate, count, islice
%o from sympy import prime
%o def A061789_gen(): # generator of terms
%o yield from accumulate(((p:=prime(k))**p for k in count(1)))
%o A061789_list = list(islice(A061789_gen(),20)) # _Chai Wah Wu_, Jun 17 2022
%Y Cf. A051674.
%K nonn,easy
%O 1,1
%A _Amarnath Murthy_, May 25 2001
%E Corrected and extended by _Jason Earls_, May 26 2001
| 