This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A051011 Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m
 0, 1, 1, 1, 8, 7, 13, 7, 16, 17, 27, 5, 32, 31, 31, 17, 46, 41, 55, 11, 50, 5, 73, 9, 68, 73, 25, 18, 96, 71, 101, 45, 32, 105, 101, 23, 124, 119, 41, 11, 146, 113, 155, 3, 44, 151, 177, 23, 164, 161, 169, 41, 204, 167, 183, 83, 64, 201, 231, 44, 240, 223, 209, 109 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..1000 Eric Weisstein's World of Mathematics, Euclidean Algorithm. PROG (Haskell) import Data.Ratio ((%), numerator) a051011 n = numerator \$ (sum \$ a051010_row n) % n -- Reinhard Zumkeller, Jun 27 2013 CROSSREFS Cf. A034883, A051010, A051012. Sequence in context: A019326 A286839 A277915 * A298666 A303716 A075573 Adjacent sequences:  A051008 A051009 A051010 * A051012 A051013 A051014 KEYWORD nonn,frac AUTHOR STATUS approved

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 January 22 15:57 EST 2019. Contains 319364 sequences. (Running on oeis4.)