id:A051010 - OEIS Search Results

Search: id:A051010

Displaying 1-1 of 1 results found.

page 1

Triangle T(m,n) giving of number of steps in the Euclidean algorithm for GCD(m,n) with 0<=m<n.

+0
5

0, 0, 1, 0, 1, 2, 0, 1, 1, 2, 0, 1, 2, 3, 2, 0, 1, 1, 1, 2, 2, 0, 1, 2, 2, 3, 3, 2, 0, 1, 1, 3, 1, 4, 2, 2, 0, 1, 2, 1, 2, 3, 2, 3, 2, 0, 1, 1, 2, 2, 1, 3, 3, 2, 2, 0, 1, 2, 3, 3, 2, 3, 4, 4, 3, 2, 0, 1, 1, 1, 1, 3, 1, 4, 2, 2, 2, 2, 0, 1, 2, 2, 2, 4, 2, 3, 5, 3, 3, 3, 2, 0, 1, 1, 3, 2, 3, 2, 1, 3, 4, 3 (list; table; graph; listen)

	OFFSET	`1,6`
	LINKS	`T. D. Noe, Rows n=1..100 of triangle, flattened` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Cf. A034883, A051011, A051012.` `Cf. A049826` `Sequence in context: A128186 A048823 A025871 this_sequence A130027 A116949 A114708` `Adjacent sequences: A051007 A051008 A051009 this_sequence A051011 A051012 A051013`
	KEYWORD	`nonn,nice,tabl`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.006 seconds

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

AT&T Labs Research