Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051011
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051011 Numerator of average of number of steps in Euclidean algorithm for all gcd(m,n) with 0<=m<n. +0
3
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; listen)
OFFSET

1,5

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

Cf. A034883, A051010, A051012.

Sequence in context: A021536 A094082 A019326 this_sequence A075573 A166138 A126937

Adjacent sequences: A051008 A051009 A051010 this_sequence A051012 A051013 A051014

KEYWORD

nonn,frac

AUTHOR

Eric Weisstein (eric(AT)weisstein.com)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research