**Let P(n) be the maximal prime divisor of 3*n+1. Then a(n) is the smallest number of iterations of P(n) such that the a(n)-th iteration < n, and a(n) = 0, if such number does not exist.**

*2, 3, 1, 6, 4, 1, 1, 6, 3, 2, 1, 2, 2, 1, 1, 1, 2, 3, 1, 3, 1, 2, 1, 2, 6, 1, 1, 1, 4, 3, 1, 2, 2, 3*

*3 seqfan posts*

Index of A-numbers in seqfan: by ascending order by month by frequency by keyword

Links to OEIS content are included according to The OEIS End-User License Agreement .