A066422

a(n) = least k such that phi^(k)(n) + 1 is prime, where phi^(k) denotes application of phi k times.