Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Apr 09 2017 10:02:07
%S 0,1,1,2,2,3,2,3,3,4,4,5,3,4,4,5,5,6,5,6,6,7,5,6,8,9,9,10,6,7,7,8,8,9,
%T 9,10,9,10,10,11,11,12,7,8,8,9,9,10,9,10,10,11,10,11,12,13,13,14,13,
%U 14,8,9,9,10,10,11,11,12,12,13,11,12,12,13,13,14
%N Number of steps to reach 1 when starting from n and iterating the map x -> x - A055396(x).
%C This sequence tends to infinity as n tends to infinity.
%H Rémy Sigrist, <a href="/A282630/b282630.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A282630/a282630.png">Illustration of the first terms</a>
%o (PARI) a = vector(100); for (n=1, #a, if (n>1, a[n] = 1 + a[n - primepi(factor(n)[1,1])]); print1 (a[n] ", "))
%Y Cf. A055396.
%K nonn
%O 1,4
%A _Rémy Sigrist_, Apr 09 2017