A342829 a(n) is the smallest number whose sum of digits is equal to the sum of digits of n.

1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 8

Offset

1,2

Links

Michel Marcus, Table of n, a(n) for n = 1..10000

Formula

a(n) = A051885(A007953(n)).

Example

For n=10, A007953(10) = 1, and 1 is the smallest integer x satisfying A007953(x)=1, so a(10)=1.

Prog

(PARI) a(n) = my(k=1, s=sumdigits(n)); while(sumdigits(k) != s, k++); k;

Crossrefs

Cf. A007953 (sum of digits), A051885.

Sequence in context: A209685 A114570 A349194 * A247796 A355370 A326344

Adjacent sequences: A342826 A342827 A342828 * A342830 A342831 A342832

Keyword

nonn,base,look

Author

Michel Marcus, Mar 23 2021

Status

approved