id:A034883 - OEIS Search Results

Search: id:A034883

Displaying 1-1 of 1 results found.

page 1

Maximum length of Euclidean algorithm starting with n and any i<n.

+0
7

0, 1, 2, 2, 3, 2, 3, 4, 3, 3, 4, 4, 5, 4, 4, 4, 4, 5, 5, 4, 6, 4, 5, 4, 5, 5, 5, 5, 6, 6, 6, 5, 5, 7, 5, 5, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 7, 7, 6, 6, 6, 5, 8, 6, 6, 6, 6, 7, 6, 6, 6, 7, 7, 7, 7, 7, 7, 6, 7, 6, 7, 7, 7, 8, 6, 6, 8, 8, 8, 7, 7, 6, 7, 7, 7, 7, 9, 6, 7, 7, 7, 7, 7, 6, 8, 7, 7, 7 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Apart from initial term, same as A071647. - Franklin T. Adams-Watters, Nov 14 2006`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	CROSSREFS	`Sequence in context: A104324 A131818 A070081 this_sequence A071647 A051125 A131830` `Adjacent sequences: A034880 A034881 A034882 this_sequence A034884 A034885 A034886`
	KEYWORD	`easy,nonn`
	AUTHOR	`Erich Friedman (erich.friedman(AT)stetson.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research