Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated.

A082449

Let f(p) = greatest prime divisor of p-1. Sequence gives smallest prime which takes at least n steps to reach 2 when f is iterated.

Terms

    a(0) =2a(1) =3a(2) =7a(3) =23a(4) =47a(5) =283a(6) =719a(7) =1439a(8) =2879a(9) =34549a(10) =138197a(11) =1266767a(12) =14619833a(13) =36449279a(14) =377982107a(15) =1432349099a(16) =22111003847

External references