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.

A072408 Least number > 1 which equals n-th power of the sum of its digits in decimal base.

This page as a plain text file.
%I A072408 #17 May 09 2024 09:08:38
%S A072408 2,81,512,2401,17210368,34012224,612220032,20047612231936,
%T A072408 3904305912313344,13744803133596058624,8007313507497959524352,
%U A072408 2518170116818978404827136,81920000000000000,2670419511272061205254504361,2759031540715333904109053133443
%N A072408 Least number > 1 which equals n-th power of the sum of its digits in decimal base.
%H A072408 Michael De Vlieger, <a href="/A072408/b072408.txt">Table of n, a(n) for n = 1..274</a>
%H A072408 Leo Moser, Digits of Powers, Recreational Mathematics, Curiosa 145. <a href="https://dspace.bcu-iasi.ro/handle/123456789/43240">Scripta Mathematica Vol. XIII</a>, March-June 1947, Nos. 1-2, page 117.
%F A072408 a(n) = Min{ x; x=SumDigit(x)^n} = Min{x; x=A007953(x)^n}
%F A072408 a(n) = A046017(n)^n. - _Michael De Vlieger_, Nov 05 2020
%e A072408 a(1) = 2 > 1;
%e A072408 a(9) = 3904305912313344 = 54^9 = (3+9+0+4+3+0+5+9+1+2+3+1+3+3+4+4)^9.
%t A072408 Array[Block[{k = 2}, While[k^# != Total[IntegerDigits[k^#]]^#, k++]; k^#] &, 13] (* _Michael De Vlieger_, Nov 05 2020 *)
%Y A072408 Cf. A007953, A046017, A072081-A072083.
%K A072408 base,nonn
%O A072408 1,1
%A A072408 _Labos Elemer_, Jun 17 2002