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!)
 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
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS EXAMPLE 103 needs k at least equal to 5 because 1^5 + 0^5 + 3^5 = 244 > 103. CROSSREFS Sequence in context: A117005 A263204 A194322 * A138471 A102669 A248327 Adjacent sequences:  A052007 A052008 A052009 * A052011 A052012 A052013 KEYWORD nonn,base AUTHOR Patrick De Geest, Nov 15 1999 STATUS approved

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 24 17:51 EDT 2021. Contains 345419 sequences. (Running on oeis4.)