|
Search: id:A003266
|
|
|
| A003266 |
|
Product of first n nonzero Fibonacci numbers F(1), ..., F(n).
(Formerly M1692)
|
|
+0
22
|
|
| 1, 1, 2, 6, 30, 240, 3120, 65520, 2227680, 122522400, 10904493600, 1570247078400, 365867569267200, 137932073613734400, 84138564904377984000, 83044763560621070208000, 132622487406311849122176000, 342696507457909818131702784000
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Equals right border of unsigned triangle A158472 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 20 2009]
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
A. Brousseau, Fibonacci and Related Number Theoretic Tables. Fibonacci Association, San Jose, CA, 1972, p. 69.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics, second edition, Addison Wesley, p 597
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.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..50
|
|
FORMULA
|
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
|
|
MAPLE
|
with(combinat); A003266 := n-> mul(fibonacci(i), i=1..n);
|
|
MATHEMATICA
|
a={}; s=1; Do[f=Fibonacci[n]; s=s*f; AppendTo[a, s], {n, 1, 15, 1}]; a (Vladimir Orlovsky, Jul 21 2008)
|
|
CROSSREFS
|
Cf. A000045.
A158472 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 20 2009]
Sequence in context: A089459 A027882 A106209 this_sequence A097385 A066068 A121406
Adjacent sequences: A003263 A003264 A003265 this_sequence A003267 A003268 A003269
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
