Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097157
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097157 Number of iterations of f(x) = reverse(x) - maxdigit(x) needed for the numbers in A097155 to reach 89. +0
6
0, 1, 2, 7, 5, 6, 4, 5, 3, 4, 1, 2, 3, 2, 13, 11, 10, 7, 9, 7, 8, 10, 10, 12, 18, 19, 7, 9, 7, 8, 8, 8, 10, 1, 0, 16, 17, 10, 5, 5, 8, 6, 8, 8, 14, 15, 9, 6, 8, 12, 13, 9, 7, 6, 8, 7, 6, 9, 6, 10, 11, 8, 10, 8, 9, 7, 11, 9, 7, 4, 7, 5, 4, 8, 9, 8, 6, 8, 9, 7, 11, 9, 3, 5, 3, 7, 6, 6, 7, 6, 8, 6, 7, 5, 9 (list; graph; listen)
OFFSET

1,3

COMMENT

89 is the first number that will not reach zero under iteration of f(x) = reverse(x) - maxdigit(x) since 98-9=89. It is conjectured that 0 and 89 are the only fixed points of f.

EXAMPLE

a(4)=7 because A097155(4)=2125 and 2125 -> 5207 -> 7018 -> 8099 -> 9899 -> 9980 -> 890 -> 89 takes 7 steps to reach 89.

CROSSREFS

Cf. A097153, A097154, A097155, A097156, A097158.

Sequence in context: A119929 A151856 A019825 this_sequence A079833 A010593 A117931

Adjacent sequences: A097154 A097155 A097156 this_sequence A097158 A097159 A097160

KEYWORD

base,easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 01 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research