A259046 Smallest m such that A259043(m) = n.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 15, 25, 16, 26, 17, 27, 18, 59, 78, 69, 88, 79, 98, 89, 108, 99, 509, 618, 609, 718, 709, 818, 809, 918, 909, 5009, 6018, 6009, 7018, 7009, 8018, 8009, 9018, 9009, 50009, 60018, 60009, 70018, 70009, 80018, 80009, 90018

Offset

0,3

Comments

A259043(a(n)) = n and A259043(m) != n for m < a(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..76

Prog

(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a259046 = fromJust . (`elemIndex` (map a259043 [0..]))
(PARI) f(n) = if (n<10, n, my(u=n%10); f(n\10 + u) + u); \\ A259043
a(n) = my(m=0); while (f(m)!=n, m++); m; \\ Michel Marcus, Jan 23 2022

Crossrefs

Cf. A259043, A051885.

Sequence in context: A276597 A199344 A366198 * A261725 A261729 A003100

Adjacent sequences: A259043 A259044 A259045 * A259047 A259048 A259049

Keyword

nonn

Author

Reinhard Zumkeller, Jun 17 2015

Status

approved