id:A016037 - OEIS Search Results

Search: id:A016037

Displaying 1-1 of 1 results found.

page 1

Map numbers to number of letters in English name; sequence gives number of steps before convergence.

+0
3

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

	OFFSET	`0,2`
	EXAMPLE	`1 -> 3 -> 5 -> 4, so f(1)=3.`
	CROSSREFS	`Sequence in context: A065431 A053375 A117252 this_sequence A106449 A097278 A056223` `Adjacent sequences: A016034 A016035 A016036 this_sequence A016038 A016039 A016040`
	KEYWORD	`nonn,word`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com)`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research