|
%I #20 Mar 23 2017 04:37:54
%S 8,4,2,7,6,5,9,1,3,2,7,2,1,9,4,5,1,6,9,0,7,2,6,3,1,9,3,9,6,3,9,6,4,1,
%T 1,5,5,9,4,5,1,8,3,8,9,3,1,9,1,5,0,4,9,6,5,2,9,2,1,2,5,3,8,7,3,8,9,9,
%U 5,6,9,6,0,4,3,6,2,2,4,0,8,1,7,0,4,2,0,3,2,2,9,6,8,8,0,0,8,1,1,3,1,9,3,1,4
%N Decimal expansion of Levy's constant 12*log(2)/Pi^2.
%C 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
%D R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see Theorem 2.1.3, p. 84.
%D S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 156.
%H G. C. Greubel, <a href="/A089729/b089729.txt">Table of n, a(n) for n = 0..10000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HarmonicNumber.html">Harmonic Number</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LevyConstant.html">Levy Constant</a>
%e 0.8427659132721945169072631939639641155945183893191504965...
%t RealDigits[12 Log[2]/Pi^2, 10, 100][[1]] (* _Bruno Berselli_, Jun 20 2013 *)
%o (PARI) 12*log(2)/Pi^2 \\ _Michel Marcus_, Mar 23 2016
%Y Cf. A086702, A086237.
%K nonn,cons
%O 0,1
%A _Benoit Cloitre_, Jan 19 2004
%E Leading zero removed by _R. J. Mathar_, Feb 05 2009
|
