|
%I #13 Apr 02 2021 11:40:05
%S 1,2,2,6,30,2310,9699690,304250263527210,
%T 40729680599249024150621323470,
%U 10014646650599190067509233131649940057366334653200433090,16516447045902521732188973253623425320896207954043566485360902980990824644545340710198976591011245999110
%N Product of the first F(n) primes, where F(n) is the n-th Fibonacci number.
%C Next term has 191 digits. - _Emeric Deutsch_, Apr 30 2006
%H Alois P. Heinz, <a href="/A117394/b117394.txt">Table of n, a(n) for n = 0..13</a>
%F a(n) = A002110(A000045(n)). - _Alois P. Heinz_, Apr 02 2021
%e a(4)=30 because the 4th Fibonacci number is 3 and the product of the first 3 primes is 2*3*5=30.
%p with(combinat): a:=n->mul(ithprime(i),i=1..fibonacci(n)): seq(a(n),n=0..10); # _Emeric Deutsch_, Apr 30 2006
%t Table[Times@@Prime[Range[Fibonacci[n]]],{n,10}] (* _Harvey P. Dale_, May 03 2018 *)
%Y Cf. A000045, A002110.
%K easy,nonn
%O 0,2
%A _Giovanni Teofilatto_, Apr 25 2006
%E More terms from _Emeric Deutsch_, Apr 30 2006
%E a(0)=1 prepended by _Alois P. Heinz_, Apr 02 2021
| 