login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A118752 a(n) = product[k=0..n] P(k), where P(k) is the smallest prime > 3*n. a(n) = product[k=0..n] A118751(k). 4
2, 10, 70, 770, 10010, 170170, 3233230, 74364290, 2156564410, 62540367890, 1938751404590, 71733801969830, 2654150672883710, 108820177588232110, 4679267636293980730, 219925578905817094310, 11656055682008305998430 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Analogous to A118456 a(n) = product{k=1..n} P(k), where P(k) is the smallest prime >= k.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..200

MATHEMATICA

Rest[FoldList[Times, 1, Table[NextPrime[3n], {n, 0, 20}]]] (* Harvey P. Dale, Mar 09 2014 *)

CROSSREFS

Cf. A020482, A049653, A060266-A060268, A060264, A060265, A060308, A118455, A118456, A118748-51.

Sequence in context: A320957 A317980 A118748 * A060842 A245834 A271214

Adjacent sequences:  A118749 A118750 A118751 * A118753 A118754 A118755

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post, Apr 29 2006

EXTENSIONS

Definition corrected by Harvey P. Dale, Mar 09 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 18:50 EST 2018. Contains 317276 sequences. (Running on oeis4.)