|
%I #5 Jan 09 2024 12:08:44
%S 1,1,1,1,1,1,1,1,1,1,2,1,2,2,2,2,2,1,2,1,1,2,2,1,2,2,1,2,2,1,2,2,2,2,
%T 2,1,2,2,2,1,2,1,2,2,1,2,2,1,2,1,2,2,2,1,2,2,2,2,2,1,2,2,1,2,2,2,2,2,
%U 2,1,2,1,2,2,2,2,2,2,2,1,1,2,2,1,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,1
%N Define f(k) = Floor [ k/ sum of the digits of k]. Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.
%e a(24) = 1 as 24 is divisible by 2+4. a(23) = 2, since f(23) = 4. a(14835)= 3 because f(14835) = 76, f(76) = 5, etc.
%Y Cf. A066578.
%K base,easy,nonn
%O 1,11
%A _Amarnath Murthy_, Mar 02 2003
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003
|
