id:A097154 - OEIS Search Results

Search: id:A097154

Displaying 1-1 of 1 results found.

page 1

Number of iterations of f(x) = reverse(x) - maxdigit(x) needed to reach zero, or -1 if zero is never reached, where maxdig(n) is the largest digit of n.

+0
6

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

	OFFSET	`1,11`
	COMMENT	`a(89)=-1 because 89 is the first number that will not reach zero: 98-9=89. It is conjectured that 0 and 89 are the only fixed points of f. See A097155 for numbers that reach 89.`
	EXAMPLE	`a(12)=4 because 12 -> 19 -> 82 -> 20 -> 0.`
	CROSSREFS	`Cf. A097153, A097155, A097156, A097157, A097158.` `Sequence in context: A008497 A108039 A162798 this_sequence A108421 A104058 A132345` `Adjacent sequences: A097151 A097152 A097153 this_sequence A097155 A097156 A097157`
	KEYWORD	`base,easy,sign`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Aug 01 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research