login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A060939 a(n) = (Sum of the first n primes) + n. 2
3, 7, 13, 21, 33, 47, 65, 85, 109, 139, 171, 209, 251, 295, 343, 397, 457, 519, 587, 659, 733, 813, 897, 987, 1085, 1187, 1291, 1399, 1509, 1623, 1751, 1883, 2021, 2161, 2311, 2463, 2621, 2785, 2953, 3127, 3307, 3489, 3681, 3875, 4073, 4273, 4485, 4709 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Variation on question 6, p. 54, of Sullivan.
REFERENCES
N. Sullivan, Test Your Own IQ, Workman Publishing Co., New York, NY, 1994, p. 54.
LINKS
FORMULA
a(n) = A007504(n) + n. - Omar E. Pol, Dec 30 2013
MAPLE
A060939:= n-> n + add(ithprime(j), j=1..n); seq(A060939(n), n=1..50); # G. C. Greubel, Apr 09 2021
MATHEMATICA
With[{nn=50}, Total/@Thread[{Accumulate[Prime[Range[nn]]], Range[nn]}]] (* Harvey P. Dale, Dec 27 2011 *)
PROG
(PARI) { s=0; n=0; forprime (p=2, prime(1000), s+=p; write("b060939.txt", n++, " ", s + n); ) } \\ Harry J. Smith, Jul 14 2009
(PARI) a(n) = vecsum(primes(n)) + n; \\ Michel Marcus, Apr 09 2021
(Magma) [n + (&+[NthPrime(k): k in [1..n]]): n in [1..50]]; # G. C. Greubel, Apr 09 2021
(Sage) [n + sum(nth_prime(k) for k in (1..n)) for n in (1..50)] # G. C. Greubel, Apr 09 2021
CROSSREFS
Sequence in context: A147342 A172310 A357370 * A174030 A355734 A098575
KEYWORD
easy,nonn
AUTHOR
Jason Earls, May 06 2001
EXTENSIONS
Better description and more terms from Larry Reeves (larryr(AT)acm.org), May 08 2001
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)