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 A217533 #4 Oct 06 2012 15:11:30 %S A217533 22011,50124,220041,704301,1056225,1101023,1122254,1404231,2106855, %T A217533 2130216,2221110,2351565,3010353,3130060,3146247,3169305,3968808, %U A217533 4053412,4150651,4213312,4293261,4351003,4499068,5053964,5794602,6277560 %N A217533 Numbers n such that sum of 5th power of digits of n equals the sum of prime divisors of n. %C A217533 n such that A055014 (n) = A008472(n). %e A217533 22011 = 3*11*23*29 is in the sequence because 2^5 + 2^5 + 0^5 + 1^5 + 1^5 = 3 + 11 + 23 + 29 = 66. %t A217533 Rest[Select[Range[8000000], Total[Transpose[FactorInteger[#]][[1]]]==Total[IntegerDigits[#]^5]&]] %Y A217533 Cf. A055014, A008472. %K A217533 nonn,easy,base %O A217533 1,1 %A A217533 _Michel Lagneau_, Oct 05 2012