Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m<n.

A051011

Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m<n.

Terms

    a(0) =0a(1) =1a(2) =1a(3) =1a(4) =8a(5) =7a(6) =13a(7) =7a(8) =16a(9) =17a(10) =27a(11) =5a(12) =32a(13) =31a(14) =31a(15) =17a(16) =46a(17) =41a(18) =55a(19) =11a(20) =50a(21) =5a(22) =73a(23) =9a(24) =68a(25) =73a(26) =25a(27) =18a(28) =96a(29) =71

External references