Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014284
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014284 Partial sums of primes (starting with 1). +0
13
1, 3, 6, 11, 18, 29, 42, 59, 78, 101, 130, 161, 198, 239, 282, 329, 382, 441, 502, 569, 640, 713, 792, 875, 964, 1061, 1162, 1265, 1372, 1481, 1594, 1721, 1852, 1989, 2128, 2277, 2428, 2585, 2748, 2915, 3088, 3267, 3448, 3639, 3832, 4029 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = Sum_{k<=n} [(A158611(k)) * (A000012(n-k+1))] = Sum_{k<=n} [(A158611(k)) * (A000012(k))] = Sum_{k<=n} [(A008578(k-1)) * (A000012(n-k+1))] = Sum_{k<=n} [(A158611(k-1)) * (A000012(k))] for n, k >= 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 05 2009]

a(n+1) = A007504(n) + 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 19 2009]

a(n+1) - a(n) = A000040(n) = n-th primes. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Aug 19 2009]

MATHEMATICA

s=1; lst={s}; Do[s+=Prime[n]; AppendTo[lst, s], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 25 2009]

CROSSREFS

Cf. A007504.

A036439(n+1) - 1.

Sequence in context: A147456 A011849 A095944 this_sequence A118482 A026905 A066778

Adjacent sequences: A014281 A014282 A014283 this_sequence A014285 A014286 A014287

KEYWORD

nonn

AUTHOR

Deepan Majmudar (dmajmuda(AT)esq.com)

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research