Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135485
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135485 Sum_{i=1..n) p(i)^(i-1), where p(i) denotes i-th prime number. +0
2
1, 4, 29, 372, 15013, 386306, 24523875, 918395614, 79229380895, 14586375356764, 834214662337565, 178751836441797978, 22742242136807984059, 1741006366419098769302, 258407992554086508103671 (list; graph; listen)
OFFSET

1,2

COMMENT

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 (107 digits number) = 2^0+3^1+5^2+....+211^46, ...

MATHEMATICA

f[n_] := Sum[Prime[i]^(i - 1), {i, n}]; Array[f, 16] (* Robert G. Wilson v *)

CROSSREFS

Cf. A000040, A087480, A135484.

Sequence in context: A099700 A137646 A000798 this_sequence A162287 A166168 A126559

Adjacent sequences: A135482 A135483 A135484 this_sequence A135486 A135487 A135488

KEYWORD

nonn

AUTHOR

Ctibor O. Zizka (ctibor.zizka(AT)seznam.cz), Feb 07 2008, Feb 17 2008

EXTENSIONS

Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 12 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research