Search: id:A062072
Results 1-1 of 1 results found.

%I A062072
%S A062072 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,
%T A062072 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,
%U A062072 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
%N A062072 Continued fraction expansion of Fibonacci factorial constant.
%D A062072 R. Graham, D. E. Knuth, O. Patashnik, Concrete Mathematics, Addison Wesley, 
               1990, pp. 478, 571.
%H A062072 Harry J. Smith, <a href="b062072.txt">Table of n, a(n) for n=1,...,5000</
               a>
%H A062072 Simon Plouffe, <a href="http://pi.lacim.uqam.ca/piDATA/fibofact.txt">
               Plouffe's Inverter</a>
%F A062072 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.
%e A062072 1.2267420107203532444176302...
%o A062072 (PARI) \p 500 a=-1/(1/2+sqrt(5)/2)^2; contfrac(prod(n=1,17000,(1-a^n)))
%o A062072 (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]
%Y A062072 Cf. A062073.
%Y A062072 Sequence in context: A037919 A049849 A112349 this_sequence A140395 A061505 
               A053879
%Y A062072 Adjacent sequences: A062069 A062070 A062071 this_sequence A062073 A062074 
               A062075
%K A062072 easy,nonn,cofr
%O A062072 1,2
%A A062072 Jason Earls (zevi_35711(AT)yahoo.com), Jun 27 2001

Search completed in 0.001 seconds