The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A117394 Product of the first F(n) primes, where F(n) is the n-th Fibonacci number. 1
 1, 2, 2, 6, 30, 2310, 9699690, 304250263527210, 40729680599249024150621323470, 10014646650599190067509233131649940057366334653200433090, 16516447045902521732188973253623425320896207954043566485360902980990824644545340710198976591011245999110 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Next term has 191 digits. - Emeric Deutsch, Apr 30 2006 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..13 FORMULA a(n) = A002110(A000045(n)). - Alois P. Heinz, Apr 02 2021 EXAMPLE a(4)=30 because the 4th Fibonacci number is 3 and the product of the first 3 primes is 2*3*5=30. MAPLE with(combinat): a:=n->mul(ithprime(i), i=1..fibonacci(n)): seq(a(n), n=0..10); # Emeric Deutsch, Apr 30 2006 MATHEMATICA Table[Times@@Prime[Range[Fibonacci[n]]], {n, 10}] (* Harvey P. Dale, May 03 2018 *) CROSSREFS Cf. A000045, A002110. Sequence in context: A164347 A052584 A094303 * A267073 A003308 A180069 Adjacent sequences:  A117391 A117392 A117393 * A117395 A117396 A117397 KEYWORD easy,nonn AUTHOR Giovanni Teofilatto, Apr 25 2006 EXTENSIONS More terms from Emeric Deutsch, Apr 30 2006 a(0)=1 prepended by Alois P. Heinz, Apr 02 2021 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 16 21:28 EDT 2021. Contains 343951 sequences. (Running on oeis4.)