A334686Start with n, and successively apply phi, phi, sigma', phi, phi, sigma', phi, ... until reaching either 0 or 1; a(n) is the number of steps needed (phi = A000010, sigma' = A001065); or a(n) = -1 if 0 or 1 is never reached.

0, 1, 2, 2, 3, 2, 3, 3, 3, 3, 5, 3, 5, 3, 5, 5, …

The first 7 terms appear at position 3,392,133.

…5890244075496184079322140122323165409169757208589225789…
position 3,392,133
termsstringfirst positionoccurrences
103299,993,942
2011679,998,250
3012659999,856
40122659100,223
50122387,38510,193
60122323,392,133998
701223233,392,133102
80122323346,821,20614
901223233346,821,2062
10012232333346,821,2061
110122323333546,821,2061
1201223233335346,821,2061

Searched the first 1,000,000,000 digits. Strings longer than 12 digits are not indexed.