A202270 a(n) is the largest n-digit number whose sum of digits is n.

1, 20, 300, 4000, 50000, 600000, 7000000, 80000000, 900000000, 9100000000, 92000000000, 930000000000, 9400000000000, 95000000000000, 960000000000000, 9700000000000000, 98000000000000000, 990000000000000000, 9910000000000000000, 99200000000000000000

Offset

1,2

Links

Michael S. Branicky, Table of n, a(n) for n = 1..1000

Maple

a:= n-> (q-> parse(cat([9$q, r, 0$(n-q-1)][])))(iquo(n, 9, 'r')):
seq(a(n), n=1..20);  # Alois P. Heinz, Aug 16 2023

Prog

(PARI) a(n) = my(k=10^n-1); while (sumdigits(k) != n, k--); k; \\ Michel Marcus, Aug 16 2023
(Python)
def a(n): return int("9"*(m:=n//9)+str(n%9)+"0"*(n-m-1))
print([a(n) for n in range(1, 21)]) # Michael S. Branicky, Aug 16 2023

Crossrefs

Cf. A061219 (without zeros).

Cf. A364578 (smallest n-digit number whose sum of digits is n).

Sequence in context: A344197 A138794 A077758 * A053541 A004345 A001755

Adjacent sequences: A202267 A202268 A202269 * A202271 A202272 A202273

Keyword

nonn,base

Author

Jaroslav Krizek, Jan 06 2012

Status

approved