login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051012 Denominator of average of number of steps in Euclidean algorithm for all GCD(m,n) with 0<=m<n. 3
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, 29, 30, 31, 16, 11, 34, 35, 9, 37, 38, 13, 4, 41, 42, 43, 1, 15, 46, 47, 8, 49, 50, 51, 13, 53, 54, 55, 28, 19, 58, 59, 15, 61, 62, 63, 32, 65, 6, 67, 17, 69, 70, 71, 36, 73, 74, 75 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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 ((%), denominator)

a051012 n = denominator $ (sum $ a051010_row n) % n

-- Reinhard Zumkeller, Jun 27 2013

CROSSREFS

Cf. A034883, A051010, A051011.

Sequence in context: A176093 A092437 A064814 * A064644 A090210 A248925

Adjacent sequences:  A051009 A051010 A051011 * A051013 A051014 A051015

KEYWORD

nonn,frac

AUTHOR

Eric W. Weisstein

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 19:00 EST 2019. Contains 319365 sequences. (Running on oeis4.)