id:A081503 - OEIS Search Results

Search: id:A081503

Displaying 1-1 of 1 results found.

page 1

Number of steps to reach a single digit when map in A081502 is iterated.

+0
2

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

	OFFSET	`0,18`
	LINKS	`Matthew M. Conroy, Home page (listed instead of email address)`
	EXAMPLE	`19 -> 3+9 = 12 -> 3+2 = 5, taking 2 steps, so a(19)=2.`
	CROSSREFS	`Sequence in context: A088496 A036602 A037804 this_sequence A047971 A029432 A073426` `Adjacent sequences: A081500 A081501 A081502 this_sequence A081504 A081505 A081506`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Apr 22 2003`
	EXTENSIONS	`More terms from Matthew Conroy (list1(AT)madandmoonly.com), Jan 16 2006`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research