%I A003266 M1692
%S A003266 1,1,2,6,30,240,3120,65520,2227680,122522400,10904493600,1570247078400,
%T A003266 365867569267200,137932073613734400,84138564904377984000,83044763560621070208000,
%U A003266 132622487406311849122176000,342696507457909818131702784000
%N A003266 Product of first n nonzero Fibonacci numbers F(1), ..., F(n).
%C A003266 Equals right border of unsigned triangle A158472 [From Gary W. Adamson 
               (qntmpkt(AT)yahoo.com), Mar 20 2009]
%D A003266 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A003266 A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci 
               Association, San Jose, CA, 1972, p. 69.
%D A003266 R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, second 
               edition, Addison Wesley, p 597
%D A003266 Y. V. Matiyasevich and R. K. Guy, A new formula for pi, Amer. Math. Monthly 
               93 (1986), no. 8, 631-635. Math. Rev. 2000i:11199.
%H A003266 T. D. Noe, <a href="b003266.txt">Table of n, a(n) for n=1..50</a>
%F A003266 a(n) is asymptotic to C*phi^(n*(n+1)/2)/sqrt(5)^n where phi=(1+sqrt(5))/
               2 is the golden ratio and the decimal expansion of C is given in 
               A062073. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 11 2003 
               Ben
%p A003266 with(combinat); A003266 := n-> mul(fibonacci(i),i=1..n);
%t A003266 a={};s=1;Do[f=Fibonacci[n];s=s*f;AppendTo[a,s],{n,1,15,1}];a (Vladimir 
               Orlovsky, Jul 21 2008)
%Y A003266 Cf. A000045.
%Y A003266 A158472 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 20 2009]
%Y A003266 Sequence in context: A089459 A027882 A106209 this_sequence A097385 A066068 
               A121406
%Y A003266 Adjacent sequences: A003263 A003264 A003265 this_sequence A003267 A003268 
               A003269
%K A003266 nonn,easy,nice
%O A003266 1,3
%A A003266 N. J. A. Sloane (njas(AT)research.att.com).