The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072408 Least number > 1 which equals n-th power of the sum of its digits in decimal base. 2

%I

%S 2,81,512,2401,17210368,34012224,612220032,20047612231936,

%T 3904305912313344,13744803133596058624,8007313507497959524352,

%U 2518170116818978404827136,81920000000000000

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

%H Michael De Vlieger, <a href="/A072408/b072408.txt">Table of n, a(n) for n = 1..274</a>

%F a(n) = Min{ x; x=SumDigit[x]^n}=Min{x; x=A007953(x)^n}

%F a(n) = A046017(n)^n. - _Michael De Vlieger_, Nov 05 2020

%e n=1: a(1)=2>1; n=9: a(9)=3904305912313344=54^9=(3+9+0+4+3+0+5+9+1+2+3+1+3+3+4+4)^9.

%t Array[Block[{k = 2}, While[k^# != Total[IntegerDigits[k^#]]^#, k++]; k^#] &, 13] (* _Michael De Vlieger_, Nov 05 2020 *)

%Y Cf. A007953, A046017, A072081-A072083.

%K base,nonn

%O 1,1

%A _Labos Elemer_, Jun 17 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 22:55 EDT 2021. Contains 345016 sequences. (Running on oeis4.)