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 #26 Jan 12 2025 11:05:16
%S 2,4,9,19,31,92,157,423,927,1966,4289,8782,12599,30355,99829,215083,
%T 341075,989353,2131842,4081435,8334082,20632999,43967926,88316866,
%U 190349299,365830423,735501679,1948602829,3036548692,9654499999,17087193298,31037622999,99594689449,181610950229,462575139319,956829383603
%N a(n) is the least number whose cube is an n-digit cube which has the maximum sum of digits (A373727(n)).
%e a(7) = 157 because among all 7-digit cubes, 157^3=3869893 is the smallest cube (another 2 larger cubes are 199^3=7880599, 208^3=8998912) who has the maximum sum of digits, 46 = A373727(7).
%t Table[t =SortBy[Map[{#, Total@IntegerDigits[#^3]} &,
%t Range[Ceiling@CubeRoot[10^(n - 1)], CubeRoot[10^n - 1]]], Last];
%t Select[t, #[[2]] == t[[-1]][[2]] &][[1, 1]], {n, 18}]
%Y Cf. A348303, A370522, A373727, A380052.
%K nonn,base,new
%O 1,1
%A _Zhining Yang_, Jan 11 2025