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!)
A228190 a(n) = sum_{i=1..n} prime(i) + product_{i=1..n} prime(i). 1
4, 11, 40, 227, 2338, 30071, 510568, 9699767, 223092970, 6469693359, 200560490290, 7420738135007, 304250263527448, 13082761331670311, 614889782588491738, 32589158477190045111, 1922760350154212639510, 117288381359406970983771, 7858321551080267055879658 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A002110(n+1) + A007504(n).
EXAMPLE
The first term of this sequence is the sum of the first 1 primes plus the product of the first 1 primes. Thus, 2+2 = 4.
The second term of this sequence is the sum of the first 2 primes plus the product of the first 2 primes. Thus, (2+3)+(2*3) = 11.
Etc..
MATHEMATICA
Table[Sum[Prime[i], {i, n}] + Product[Prime[i], {i, n}], {n, 30}] (* T. D. Noe, Aug 16 2013 *)
Module[{nn=20, pr}, pr=Prime[Range[nn]]; Accumulate[pr]+FoldList[Times, pr]] (* Harvey P. Dale, Apr 18 2022 *)
CROSSREFS
Sequence in context: A214142 A077236 A327025 * A289283 A152532 A343548
KEYWORD
nonn,easy
AUTHOR
Derek Orr, Aug 15 2013
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 August 22 00:18 EDT 2024. Contains 375353 sequences. (Running on oeis4.)