%I #18 Oct 18 2014 09:26:41
%S 0,0,0,0,0,0,0,0,0,0,25,0,24,3,1,6,23,0,2,0,0,7,5,0,22,6,0,4,1,0,3,21,
%T 5,5,2,0,20,3,4,0,4,0,1,26,0,3,19,0,2,0,3,25,26,0,9,2,2,18,24,0,25,1,
%U 0,23,8,4,1,24,1,0,17,0,23,22,2,7,24,3,16,0,0,23,22,0
%N a(n) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at n, or -1 if a Harshad number is never reached.
%D Eric Angelini, Posting to Sequence Fans Mailing List, Sep 20 2010
%H Hans Havermann, <a href="http://chesswanks.com/seq/StepsToHarshad.txt">Steps to reach a Harshad</a>
%Y Cf. A005349, A062028, A181664.
%K nonn,base
%O 1,11
%A _N. J. A. Sloane_, Nov 18 2010
%E a(22) onward from _John W. Layman_, Nov 19 2010