login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052010 Smallest k such that the sum of the digits of n each raised to k-th power is greater than n, or 0 if no such k exists. 0

%I #7 Oct 17 2019 22:37:19

%S 0,0,2,2,2,2,2,2,2,2,0,0,4,3,2,2,2,2,2,2,5,5,4,3,3,2,2,2,2,2,4,4,3,3,

%T 3,3,2,2,2,2,3,3,3,3,3,3,2,2,2,2,3,3,3,3,3,3,2,2,2,2,3,3,3,3,3,3,2,2,

%U 2,2,3,3,3,3,3,3,2,2,2,2,3,3,3,3,3,2,2,2,2,2,3,3,3,3,2,2,2,2,2,2,0,0,7,5,4

%N Smallest k such that the sum of the digits of n each raised to k-th power is greater than n, or 0 if no such k exists.

%e 103 needs k at least equal to 5 because 1^5 + 0^5 + 3^5 = 244 > 103.

%K nonn,base

%O 0,3

%A _Patrick De Geest_, Nov 15 1999

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:11 EDT 2024. Contains 371935 sequences. (Running on oeis4.)