Consider the sequence b(1) = n, b(k) is the greatest prime factor of 3*b(k-1)+2. It is conjectured that this always becomes cyclic; a(n) = length of cycle (or 0 if no cycle is reached).
A084923
Consider the sequence b(1) = n, b(k) is the greatest prime factor of 3*b(k-1)+2. It is conjectured that this always becomes cyclic; a(n) = length of cycle (or 0 if no cycle is reached).
Terms
- a(0) =20a(1) =1a(2) =22a(3) =21a(4) =19a(5) =20a(6) =20a(7) =20a(8) =27a(9) =2a(10) =21a(11) =25a(12) =19a(13) =22a(14) =21a(15) =20a(16) =19a(17) =21a(18) =24a(19) =26a(20) =20a(21) =20a(22) =19a(23) =28a(24) =22a(25) =20a(26) =20a(27) =20a(28) =26a(29) =20
External references
- oeis: A084923