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.

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

This page as a plain text file.
%I A051012 #18 Feb 16 2025 08:32:41
%S A051012 1,2,1,1,5,6,7,4,9,10,11,3,13,14,15,8,17,18,19,5,21,2,23,4,25,26,9,7,
%T A051012 29,30,31,16,11,34,35,9,37,38,13,4,41,42,43,1,15,46,47,8,49,50,51,13,
%U A051012 53,54,55,28,19,58,59,15,61,62,63,32,65,6,67,17,69,70,71,36,73,74,75
%N A051012 Denominator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0 <= m < n.
%H A051012 Reinhard Zumkeller, <a href="/A051012/b051012.txt">Table of n, a(n) for n = 1..1000</a>
%H A051012 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/EuclideanAlgorithm.html">Euclidean Algorithm</a>.
%t A051012 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_] := Denominator[Sum[t[m, n], {m, 0, n}]/n]; Array[a, 100] (* _Amiram Eldar_, Apr 22 2022 after _Jean-François Alcover_ at A051010 *)
%o A051012 (Haskell)
%o A051012 import Data.Ratio ((%), denominator)
%o A051012 a051012 n = denominator $ (sum $ a051010_row n) % n
%o A051012 -- _Reinhard Zumkeller_, Jun 27 2013
%Y A051012 Cf. A034883, A051010, A051011 (numerators).
%K A051012 nonn,frac
%O A051012 1,2
%A A051012 _Eric W. Weisstein_