This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A379869 #32 Apr 03 2025 20:35:12 %S A379869 2,4,9,19,31,92,157,423,927,1966,4289,8782,12599,30355,99829,215083, %T A379869 341075,989353,2131842,4081435,8334082,20632999,43967926,88316866, %U A379869 190349299,364929616,735501679,1948602829,3036548692,9654499999,17087193298,31037622999,99594689449,181610950229,426932901019,956829383603 %N A379869 a(n) is the least number whose cube is an n-digit cube which has the maximum sum of digits (A373727(n)). %e A379869 For n=7, the maximum sum of digits for a 7-digit cube is A373727(7) = 46 and this is attained by 3 cubes, the smallest of which is 157^3 = 3869893 so that a(7) = 157. %t A379869 Table[t =SortBy[Map[{#, Total@IntegerDigits[#^3]} &, %t A379869 Range[Ceiling@CubeRoot[10^(n - 1)], CubeRoot[10^n - 1]]], Last]; %t A379869 Select[t, #[[2]] == t[[-1]][[2]] &][[1, 1]], {n, 18}] %o A379869 (C) /* See A373727. */ %Y A379869 Cf. A373727, A380052. %Y A379869 Other powers: A380111, A379650, A380567. %K A379869 nonn,base %O A379869 1,1 %A A379869 _Zhining Yang_, Jan 11 2025 %E A379869 a(26) and a(35) corrected by _Kevin Ryde_, Apr 03 2025