A240387 Least k such that sum of n-th power of digits of k equals sum of prime divisors of k.

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

Links

Table of n, a(n) for n=1..15.

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

Cf. A008472, A217390, A217531, A217532, A217533.

Sequence in context: A091144 A275829 A351731 * A087800 A009747 A208866

Adjacent sequences: A240384 A240385 A240386 * A240388 A240389 A240390

Keyword

nonn,base,hard

Author

Michel Lagneau, Apr 04 2014

Status

approved