A269333 Smallest number such that the sum of the digits of n * a(n) is greater than n.

2, 2, 2, 2, 3, 3, 4, 6, 11, 29, 6, 8, 6, 7, 33, 18, 17, 111, 21, 249, 38, 44, 39, 162, 239, 153, 737, 246, 231, 2333, 258, 309, 303, 882, 1971, 8333, 2027, 1842, 2051, 19997, 2439, 7119, 2093, 13409, 111111, 13043, 10617, 20831, 18161, 399999, 72549, 55769, 56583

Offset: 1

Author

Franklin T. Adams-Watters, Feb 24 2016

Keywords

• nonn
• base

Crossrefs

Cf. A269332.

Programs

PARI

a(n) = my(m=2*n); while (sumdigits(m) <= n, m+=n); m/n; \\ Michel Marcus, Feb 24 2016

Python

from itertools import count
def A269333(n): return next(k for k in count(2) if sum(map(int,str(k*n)))>n) # Chai Wah Wu, Jul 25 2022

Formula

a(n) = A269332(n) / n.

Extensions

More terms from Michel Marcus, Feb 24 2016