OFFSET
0,1
COMMENTS
For x>y in [1..n], the average number of loop steps of the Euclid Algorithm for GCD (over all choices x, y) is asymptotic to k*log(n) where k is this constant. See Crandall & Pomerance. - Michel Marcus, Mar 23 2016
REFERENCES
R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see Theorem 2.1.3, p. 84.
S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 156.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Harmonic Number
Eric Weisstein's World of Mathematics, Levy Constant
EXAMPLE
0.8427659132721945169072631939639641155945183893191504965...
MATHEMATICA
RealDigits[12 Log[2]/Pi^2, 10, 100][[1]] (* Bruno Berselli, Jun 20 2013 *)
PROG
(PARI) 12*log(2)/Pi^2 \\ Michel Marcus, Mar 23 2016
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Benoit Cloitre, Jan 19 2004
EXTENSIONS
Leading zero removed by R. J. Mathar, Feb 05 2009
STATUS
approved