|
%I #19 Dec 20 2015 13:44:26
%S 1,2,10,130,11570,2695810,4305208570,18000077031170,
%T 515828207482238690,265253823305384119320010,
%U 357102999447516172932830542690,8626828910804196810251673542315707730
%N Product_{k=1..n} F(p(k)), where p(k) is the k-th prime and F(k) is the k-th Fibonacci number.
%H Harry J. Smith, <a href="/A111135/b111135.txt">Table of n, a(n) for n = 1..50</a>
%e The first 3 primes are 2, 3 and 5. So a(3) = F(2)*F(3)*F(5) = 1*2*5 = 10.
%t f[n_] := Product[Fibonacci[Prime[i]], {i, n}]; Array[f, 12] (* _Robert G. Wilson v_, Oct 21 2005 *)
%o (PARI) { a=1;n=0; forprime (p=2, 425, n++; a=a*fibonacci(p); write("b111135.txt", n, " ", a); ) } \\ _Harry J. Smith_, Mar 08 2009
%K nonn
%O 1,2
%A _Leroy Quet_, Oct 17 2005
%E More terms from _Robert G. Wilson v_, Oct 21 2005
%E b-file shortened by _N. J. A. Sloane_, Aug 31 2009 to remove exceptionally large numbers
|
