login
This site is supported by donations 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
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; internal format)
OFFSET

0,3

EXAMPLE

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

CROSSREFS

Sequence in context: A190311 A117005 A194322 * A138471 A102669 A055098

Adjacent sequences:  A052007 A052008 A052009 * A052011 A052012 A052013

KEYWORD

nonn,base

AUTHOR

Patrick De Geest (pdg(AT)worldofnumbers.com), Nov 15 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.