Define f(n)= n + tau(n), then a(n) = k where k is the number of steps required to get the smallest prime of the form f(f(f...f(n)))).

A079834

Define f(n)= n + tau(n), then a(n) = k where k is the number of steps required to get the smallest prime of the form f(f(f...f(n)))).

Terms

    a(0) =1a(1) =2a(2) =1a(3) =1a(4) =1a(5) =11a(6) =11a(7) =10a(8) =10a(9) =10a(10) =1a(11) =9a(12) =2a(13) =9a(14) =1a(15) =10a(16) =1a(17) =8a(18) =10a(19) =8a(20) =9a(21) =8a(22) =9a(23) =7a(24) =8a(25) =7a(26) =1a(27) =7a(28) =1a(29) =6

External references