login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

G. C. Greubel, Table of n, a(n) for n = 1..250

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

Cf. A000040, A087480, A135484.

Sequence in context: A231498 A168602 A000798 * A210526 A221079 A162287

Adjacent sequences:  A135482 A135483 A135484 * A135486 A135487 A135488

KEYWORD

nonn

AUTHOR

Ctibor O. Zizka, Feb 07 2008, Feb 17 2008

EXTENSIONS

Edited and extended by Robert G. Wilson v, Feb 12 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 14:44 EST 2019. Contains 329806 sequences. (Running on oeis4.)