This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A240387 #7 Apr 07 2014 03:14:06
%S A240387 2,12,142,210,22011,210120,101220,11012210,2202120,11210021221,
%T A240387 1100200012,1000200000111,1211201222,211222020,101101001120
%N A240387 Least k such that sum of n-th power of digits of k equals sum of prime divisors of k.
%C A240387 a(16) <= 1001110220200020. - _Giovanni Resta_, Apr 07 2014
%e A240387 a(5) = 22011 = 3*11*23*29 because 2^5 + 2^5 + 0^5 + 1^5 + 1^5 = 3 + 11 + 23 + 29 = 66.
%t A240387 Do[k=2;While[!Total[Transpose[FactorInteger[k]][[1]]]==Total[IntegerDigits[k]^n],k++];Print[n," ",k],{n,1,15}]
%Y A240387 Cf. A008472, A217390, A217531, A217532, A217533.
%K A240387 nonn,base,hard
%O A240387 1,1
%A A240387 _Michel Lagneau_, Apr 04 2014