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 A217531 #4 Oct 06 2012 15:11:08 %S A217531 142,402,5505,6127,7305,12643,13550,21033,21452,22244,22290,22532, %T A217531 24030,24936,25612,28132,32040,35125,35296,43053,47835,51404,51703, %U A217531 52324,55869,66003,69060,80125,82464,86833,101061,102240,103039,104647,110334,110616,111153 %N A217531 Numbers n such that sum of cubes of digits of n equals the sum of prime divisors of n. %C A217531 n such that A055012 (n) = A008472(n). %e A217531 402 = 2*3*67 is in the sequence because 4^3 + 0^3 + 2^3 = 2 + 3 + 67 = 72. %t A217531 Rest[Select[Range[20000], Total[Transpose[FactorInteger[#]][[1]]]==Total[IntegerDigits[#]^3]&]] %Y A217531 Cf. A055012, A008472, A217390. %K A217531 nonn,easy,base %O A217531 1,1 %A A217531 _Michel Lagneau_, Oct 05 2012