[go: nahoru, domu]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: a086237 -id:a086237
Displaying 1-2 of 2 results found. page 1
     Sort: relevance | references | number | modified | created      Format: long | short | data
A089729 Decimal expansion of Levy's constant 12*log(2)/Pi^2. +10
6
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, 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, 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 (list; constant; graph; refs; listen; history; text; internal format)
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
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
A143304 Decimal expansion of Norton's constant. +10
1
0, 6, 5, 3, 5, 1, 4, 2, 5, 9, 2, 3, 0, 3, 7, 3, 2, 1, 3, 7, 8, 7, 8, 2, 6, 2, 6, 7, 6, 3, 1, 0, 7, 9, 3, 0, 8, 1, 3, 0, 2, 4, 5, 3, 6, 8, 4, 9, 4, 2, 3, 7, 9, 7, 6, 5, 9, 0, 7, 1, 4, 4, 9, 6, 8, 1, 5, 7, 7, 0, 7, 5, 8, 0, 5, 4, 3, 1, 9, 9, 4, 9, 4, 6, 9, 4, 2, 0, 6, 8, 7, 1, 6, 3, 6, 4, 5, 5, 8, 9, 9, 7, 4, 2, 3 (list; constant; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
The average number of divisions required by the Euclidean algorithm, for a pair of independently and uniformly chosen numbers in the range [1, N] is (12*log(2)/Pi^2) * log(N) + c + O(N^(e-1/6)), for any e>0, where c is this constant (Norton, 1990). - Amiram Eldar, Aug 27 2020
REFERENCES
Steven R. Finch, Mathematical Constants, Cambridge University Press, 2003, p. 157.
LINKS
Graham H. Norton, On the asymptotic analysis of the Euclidean algorithm, J. Symbolic Comput., Vol. 10 (1990), pp. 53-58.
Eric Weisstein's World of Mathematics, Norton's Constant.
FORMULA
Equals -((Pi^2 - 6*log(2)*(-3 + 2*EulerGamma + log(2) + 24*log(Glaisher) - 2*log(Pi)))/Pi^2).
Equals (12*log(2)/Pi^2) * (zeta'(2)/zeta(2) - 1/2) + A086237 - 1/2. - Amiram Eldar, Aug 27 2020
EXAMPLE
0.06535142592303732137...
MATHEMATICA
RealDigits[-((Pi^2 - 6*Log[2]*(24 * Log[Glaisher] + 2*EulerGamma + Log[2] - 2 * Log[Pi] - 3))/Pi^2), 10, 100][[1]] (* Amiram Eldar, Aug 27 2020 *)
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Eric W. Weisstein, Aug 05 2008
STATUS
approved
page 1

Search completed in 0.006 seconds

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 29 03:05 EDT 2024. Contains 374727 sequences. (Running on oeis4.)