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, 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

Offset

0,3

Links

Table of n, a(n) for n=0..104.

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