A094150 - OEIS

%I #8 Dec 15 2017 17:36:38

%S 5,13,12,3,11,10,15,3,14,3,5,18,13,4,18,18,5,2,4,3,12,10,21,12,18,16,

%T 11,19,20,4,6,12,13,6,6,5,3,16,5,12,12,11,18,16,18,17,12,5,12,12,18,

%U 19,14,4,5,12,18,10,16,6,13,17,21,19,6,13,19,4,3,7,15,10,21,4,18,3,5,20,11,18

%N Number of iterations of the sum of digits of the divisors of R(n) needed to reach 15, where R(n) = A002275.

%e a(9)=3 because 111111111 -> 151 -> 8 -> 15.

%e a(1) does not exist because 1 -> 1 and never reaches 15.

%Y Cf. A034690, A086793.

%K less,nonn,base

%O 2,1

%A _Jason Earls_, Jun 01 2004

%E More terms from _David Wasserman_, May 22 2007