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 A380193 #29 Mar 25 2025 08:57:07
%S A380193 1,2,3,4,6,7,12,19,31,46,68,96,143,206,304,461,677,977,1194,2136,2896,
%T A380193 4633,6373,9763,13817,21542,30643,43693,68123,99812,144083,183967,
%U A380193 311296,463976,681017,994333,1441977,2150104,3022731,4608562,6765526,9258023
%N A380193 a(n) is the largest number whose sixth power is an n-digit sixth power which has the maximum sum of digits (A373994(n)).
%H A380193 Zhining Yang, <a href="/A380193/b380193.txt">Table of n, a(n) for n = 1..55</a> [a(47) corrected by _Kevin Ryde_, Mar 25 2025]
%e A380193 a(11) = 68 because among all 11-digit sixth powers(47^6-68^6), 64^6=68719476736 and 68^6=98867482624 have the maximum sum of digits, 96 = A373994(11) and 68 is the largest number.
%t A380193 Table[t=SortBy[Map[{#,Total@IntegerDigits[#^6]}&,Range[Ceiling[10^((n-1)/6)],Floor[(10^n-1)^(1/6)]]],Last];
%t A380193 Select[t,#[[2]]==t[[-1]][[2]]&][[1,1]],{n,36}]
%o A380193 (C) /* See A373994. */
%Y A380193 Cf. A373994, A380567.
%Y A380193 Other powers: A379298, A380052, A380797, A380566.
%K A380193 nonn,base
%O A380193 1,2
%A A380193 _Zhining Yang_, Jan 15 2025