This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A230305 #16 Mar 16 2020 13:03:00
%S A230305 0,0,2,0,1,0,1,4,3,0,1,0,3,4,2,0,3,0
%N A230305 Iterate A080670 starting at n; a(n) = number of steps to reach a prime, or -1 if no prime is ever reached.
%C A230305 If n is a prime, a(n) = 0.
%C A230305 a(20) is presently unknown - see A195265 for the trajectory.
%e A230305 9 -> 32 -> 25 -> 52 -> 2213, which is prime, taking 4 steps, so a(9) = 4.
%t A230305 fn[n_] := FromDigits[Flatten[IntegerDigits[DeleteCases[Flatten[FactorInteger[n]], 1]]]];
%t A230305 Map[Length, Table[NestWhileList[fn, n, # != 1 && ! PrimeQ[#] &], {n, 2,
%t A230305 19}], {1}] - 1 (* _Robert Price_, Mar 16 2020 *)
%Y A230305 Cf. A080670, A195264 (the prime that is reached), A195265, A067599, A037271 (home primes).
%K A230305 nonn,base,more,hard
%O A230305 2,3
%A A230305 _N. J. A. Sloane_, Oct 27 2013