login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A202270
a(n) is the largest n-digit number whose sum of digits is n.
2
1, 20, 300, 4000, 50000, 600000, 7000000, 80000000, 900000000, 9100000000, 92000000000, 930000000000, 9400000000000, 95000000000000, 960000000000000, 9700000000000000, 98000000000000000, 990000000000000000, 9910000000000000000, 99200000000000000000
OFFSET
1,2
LINKS
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
KEYWORD
nonn,base
AUTHOR
Jaroslav Krizek, Jan 06 2012
STATUS
approved