Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #3 Mar 30 2012 17:26:21
%S 0,4131,12546,14382,16218,16830,26469
%N Numbers n such that n is k*(the sum of decimal digits squared of n), k=153 case.
%C k=153 case has the longest sequence for k <= 1000.
%t k=153; Do[If[n==k*Total[IntegerDigits[n]^2],Print[n]],{n,0,200000,k}]
%Y Cf. A117565 k=7 case.
%K base,fini,full,nonn
%O 1,2
%A _Zak Seidov_, Apr 30 2006