cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A051011 #20 Feb 16 2025 08:32:41
%S A051011 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,
%T A051011 25,18,96,71,101,45,32,105,101,23,124,119,41,11,146,113,155,3,44,151,
%U A051011 177,23,164,161,169,41,204,167,183,83,64,201,231,44,240,223,209,109
%N A051011 Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m<n.
%H A051011 Reinhard Zumkeller, <a href="/A051011/b051011.txt">Table of n, a(n) for n = 1..1000</a>
%H A051011 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EuclideanAlgorithm.html">Euclidean Algorithm</a>.
%t A051011 t[m_, n_] := For[r[-1]=m; r[0]=n; k=1, True, k++, r[k] = Mod[r[k-2], r[k-1]]; If[r[k] == 0, Return[k-1]]]; a[n_] := Numerator[Sum[t[m, n], {m, 0, n}]/n]; Array[a, 100] (* _Amiram Eldar_, Apr 22 2022 after _Jean-François Alcover_ at A051010 *)
%o A051011 (Haskell)
%o A051011 import Data.Ratio ((%), numerator)
%o A051011 a051011 n = numerator $ (sum $ a051010_row n) % n
%o A051011 -- _Reinhard Zumkeller_, Jun 27 2013
%Y A051011 Cf. A034883, A051010, A051012 (denominators).
%K A051011 nonn,frac
%O A051011 1,5
%A A051011 _Eric W. Weisstein_