login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109891 Least number that requires n steps to reach 0 by repeated application of f: x -> abs(x - reverse(x)). 0
0, 1, 10, 16, 14, 15, 13, 1011, 1017, 1037, 1027, 1014, 1013, 1028, 100143, 100135, 100145, 100134, 100103, 100195, 100137, 100227, 100114, 100128, 100194, 100107, 100307, 100277, 100413, 100345, 100429, 100215, 100444, 100237, 100433, 100335 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Coincides with A072138 for the first 14 and many later terms.

LINKS

Table of n, a(n) for n=0..35.

EXAMPLE

f(16) = 61-16 = 45, f(45) = 54-45 = 9, f(9) = 9-9 = 0. For no k < 16 exactly three steps lead to 0, hence a(3) = 16.

CROSSREFS

Cf. A072137, A072138, A072141.

Sequence in context: A341012 A072968 A072138 * A104869 A104868 A103208

Adjacent sequences:  A109888 A109889 A109890 * A109892 A109893 A109894

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy, Jul 13 2005

EXTENSIONS

Edited, corrected and extended by Klaus Brockhaus, Jul 14 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 7 19:07 EST 2021. Contains 341928 sequences. (Running on oeis4.)