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

%I #24 Apr 09 2021 09:15:54

%S 3,7,13,21,33,47,65,85,109,139,171,209,251,295,343,397,457,519,587,

%T 659,733,813,897,987,1085,1187,1291,1399,1509,1623,1751,1883,2021,

%U 2161,2311,2463,2621,2785,2953,3127,3307,3489,3681,3875,4073,4273,4485,4709

%N a(n) = (Sum of the first n primes) + n.

%C Variation on question 6, p. 54, of Sullivan.

%D N. Sullivan, Test Your Own IQ, Workman Publishing Co., New York, NY, 1994, p. 54.

%H Harry J. Smith, <a href="/A060939/b060939.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A007504(n) + n. - _Omar E. Pol_, Dec 30 2013

%p A060939:= n-> n + add(ithprime(j), j=1..n); seq(A060939(n), n=1..50); # _G. C. Greubel_, Apr 09 2021

%t With[{nn=50},Total/@Thread[{Accumulate[Prime[Range[nn]]],Range[nn]}]] (* _Harvey P. Dale_, Dec 27 2011 *)

%o (PARI) { s=0; n=0; forprime (p=2, prime(1000), s+=p; write("b060939.txt", n++, " ", s + n); ) } \\ _Harry J. Smith_, Jul 14 2009

%o (PARI) a(n) = vecsum(primes(n)) + n; \\ _Michel Marcus_, Apr 09 2021

%o (Magma) [n + (&+[NthPrime(k): k in [1..n]]): n in [1..50]]; # _G. C. Greubel_, Apr 09 2021

%o (Sage) [n + sum(nth_prime(k) for k in (1..n)) for n in (1..50)] # _G. C. Greubel_, Apr 09 2021

%Y Cf. A000290, A002378, A007504, A024916, A062736.

%K easy,nonn

%O 1,1

%A _Jason Earls_, May 06 2001

%E Better description and more terms from Larry Reeves (larryr(AT)acm.org), May 08 2001

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 March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)