login
A240387
Least k such that sum of n-th power of digits of k equals sum of prime divisors of k.
0
2, 12, 142, 210, 22011, 210120, 101220, 11012210, 2202120, 11210021221, 1100200012, 1000200000111, 1211201222, 211222020, 101101001120
OFFSET
1,1
COMMENTS
a(16) <= 1001110220200020. - Giovanni Resta, Apr 07 2014
EXAMPLE
a(5) = 22011 = 3*11*23*29 because 2^5 + 2^5 + 0^5 + 1^5 + 1^5 = 3 + 11 + 23 + 29 = 66.
MATHEMATICA
Do[k=2; While[!Total[Transpose[FactorInteger[k]][[1]]]==Total[IntegerDigits[k]^n], k++]; Print[n, " ", k], {n, 1, 15}]
CROSSREFS
KEYWORD
nonn,base,hard
AUTHOR
Michel Lagneau, Apr 04 2014
STATUS
approved