cp's OEIS Frontend

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.

A380111 a(n) is the least number whose fourth power is an n-digit fourth power which has the maximum sum of digits (A373914(n)).

This page as a plain text file.
%I A380111 #15 Mar 29 2025 02:29:23
%S A380111 1,3,4,8,16,26,47,74,118,308,518,659,1768,2868,5396,8256,14482,28871,
%T A380111 55368,97063,147768,228558,562341,835718,1727156,2878406,5458722,
%U A380111 8175708,16234882,27831542,53129506,98665756,166025442,315265896,510466356,904245732,1188893858,2298249374,5106312756
%N A380111 a(n) is the least number whose fourth power is an n-digit fourth power which has the maximum sum of digits (A373914(n)).
%H A380111 Zhining Yang, <a href="/A380111/b380111.txt">Table of n, a(n) for n = 1..49</a> [a(42) and a(49) corrected by _Kevin Ryde_, Mar 29 2025]
%e A380111 a(7) = 47 because among all 7-digit fourth powers, 47^4=487968 is the least one (another larger is 56^4=9834496) which has the maximum sum of digits, 43 = A373914(7).
%t A380111 Table[t=SortBy[Map[{#,Total@IntegerDigits[#^4]}&,Range[Ceiling[10^((n-1)/4)],Floor[(10^n-1)^(1/4)]]],Last];
%t A380111 Select[t,#[[2]]==t[[-1]][[2]]&][[1,1]],{n,24}]
%o A380111 (C) /* See A373914. */
%Y A380111 Cf. A373914, A380797.
%Y A380111 Other powers: A379869, A379650, A380567.
%K A380111 nonn,base
%O A380111 1,2
%A A380111 _Zhining Yang_, Jan 12 2025