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”).
%I #34 Mar 31 2024 16:29:22
%S 1,11,102,1003,10004,100005,1000006,10000007,100000008,1000000009,
%T 10000000019,100000000029,1000000000039,10000000000049,
%U 100000000000059,1000000000000069,10000000000000079,100000000000000089,1000000000000000099,10000000000000000199
%N a(n) is the smallest n-digit number whose sum of digits is n.
%H Michael S. Branicky, <a href="/A364578/b364578.txt">Table of n, a(n) for n = 1..1000</a>
%t Table[Module[{t=10^n},While[Total[IntegerDigits[t]]!=n+1,t++];t],{n,0,20}] (* or *) Join[{1},10^Range[63]+Flatten[Table[(k+1) 10^n-1,{n,0,6},{k,9}]]] (* _Harvey P. Dale_, Mar 31 2024 *)
%o (PARI) a(n) = my(k=10^(n-1)); while (sumdigits(k) != n, k++); k; \\ _Michel Marcus_, Aug 16 2023
%o (Python)
%o def a(n): m=(n-1)//9; return int("1"+"0"*(n-m-2)+str((n-1)%9)*(n>1)+"9"*m)
%o print([a(n) for n in range(1,21)]) # _Michael S. Branicky_, Aug 16 2023
%Y Cf. A051885, A202270 (largest instead of smallest).
%K nonn,base,easy
%O 1,2
%A _Roland Kneer_, Aug 14 2023