This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062072 Continued fraction expansion of Fibonacci factorial constant. 2

%I

%S 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,

%T 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,

%U 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

%N Continued fraction expansion of Fibonacci factorial constant.

%D R. Graham, D. E. Knuth, O. Patashnik, Concrete Mathematics, Addison Wesley, 1990, pp. 478, 571.

%H Harry J. Smith, <a href="/A062072/b062072.txt">Table of n, a(n) for n = 1..5000</a>

%H Simon Plouffe, <a href="http://www.plouffe.fr/simon/constants/fibofact.txt">Plouffe's Inverter</a>

%F 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 1.2267420107203532444176302...

%o (PARI) \p 500 a=-1/(1/2+sqrt(5)/2)^2; contfrac(prod(n=1,17000,(1-a^n)))

%o (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])) } \\ _Harry J. Smith_, Jul 31 2009

%Y Cf. A062073.

%K easy,nonn,cofr

%O 1,2

%A _Jason Earls_, Jun 27 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 20 14:12 EDT 2019. Contains 325182 sequences. (Running on oeis4.)