Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #9 Jan 19 2021 04:18:12
%S 1,0,0,1,0,1,0,3,-1,1,0
%N Conjectured values of a(n) defined by a(n) = least number of applications of f(k) = k^2 + 1 to n to yield a prime, if this number exists; = -1 otherwise.
%C a(9) = -1 is conjectural. If a(9) is positive, then a(9) > 14. (f^15)(9) already has several thousand digits. (f^n denotes f applied n times.)
%C From _James Rayman_, Jan 18 2021: (Start)
%C If a(9) is positive, then a(9) > 53. For all 0 <= n <= 53, (f^n)(9) has a prime factor less than 10^9. (f^54)(9) has no prime factors less than 2*10^10.
%C If a(9) is positive, (f^a(9))(9) would be a prime with at least 10^16 digits. In comparison, the largest known prime at the time of writing has about 2*10^7 digits. (End)
%e f(f(f(8))) = f(f(65)) = f(4226) = 17859077, a prime. Since 8, 65, 4226 are composite, then a(8) = 3.
%K more,sign
%O 1,8
%A _Joseph L. Pe_, Jan 16 2002