|
Search: id:A062072
|
|
|
| A062072 |
|
Continued fraction expansion of Fibonacci factorial constant. |
|
+0
2
|
|
| 1, 4, 2, 2, 3, 2, 15, 9, 1, 2, 1, 2, 15, 7, 6, 21, 3, 5, 1, 23, 1, 11, 1, 7, 1, 3, 1, 12, 2, 1, 1, 1, 7, 1, 3, 1, 12, 2, 1, 2, 2, 9, 27, 1, 1, 1, 1, 2, 19, 3, 8, 1, 1, 15, 3, 1, 2, 1, 1, 1, 3, 2, 3, 8, 1, 1, 14, 1, 49, 2, 1, 17, 4, 2, 1, 2, 2, 1, 3, 1, 5, 1, 1, 3, 1, 2, 1, 4, 1, 2, 5, 1, 3, 2, 1, 1, 2, 6
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
R. Graham, D. E. Knuth, O. Patashnik, Concrete Mathematics, Addison Wesley, 1990, pp. 478, 571.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,5000
Simon Plouffe, Plouffe's Inverter
|
|
FORMULA
|
C = (1-a)*(1-a^2)*(1-a^3)... 1.2267420... where a = -1/phi^2 and where phi is the Golden ratio = 1/2 + sqrt(5)/2.
|
|
EXAMPLE
|
1.2267420107203532444176302...
|
|
PROGRAM
|
(PARI) \p 500 a=-1/(1/2+sqrt(5)/2)^2; contfrac(prod(n=1, 17000, (1-a^n)))
(PARI) { allocatemem(932245000); default(realprecision, 5300); p=-1/(1/2 + sqrt(5)/2)^2; x=contfrac(prodinf(k=1, 1-p^k)); for (n=1, 5000, write("b062072.txt", n, " ", x[n])) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 31 2009]
|
|
CROSSREFS
|
Cf. A062073.
Sequence in context: A037919 A049849 A112349 this_sequence A140395 A061505 A053879
Adjacent sequences: A062069 A062070 A062071 this_sequence A062073 A062074 A062075
|
|
KEYWORD
|
easy,nonn,cofr
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jun 27 2001
|
|
|
Search completed in 0.002 seconds
|
