|
|
A135485
|
|
a(n) = Sum_{i=1..n} prime(i)^(i-1), where prime(i) denotes i-th prime number.
|
|
2
|
|
|
1, 4, 29, 372, 15013, 386306, 24523875, 918395614, 79229380895, 14586375356764, 834214662337565, 178751836441797978, 22742242136807984059, 1741006366419098769302, 258407992554086508103671
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The primes in this sequence are 29 = 2^0 + 3^1 + 5^2, 15013 = 2^0 + 3^1 + 5^2 + 7^3 + 11^4, 82630...60939 (a 107-digit number) = 2^0 + 3^1 + 5^2 + ... + 211^46, ...
|
|
LINKS
|
|
|
MATHEMATICA
|
f[n_] := Sum[Prime[i]^(i - 1), {i, n}]; Array[f, 16] (* Robert G. Wilson v, Feb 12 2008 *)
|
|
PROG
|
(PARI) a(n) = sum(k=1, n, prime(k)^(k-1)); \\ Michel Marcus, Oct 15 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|