login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066746 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. 0
1, 0, 0, 1, 0, 1, 0, 3, -1, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,8

COMMENTS

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.)

From James Rayman, Jan 18 2021: (Start)

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.

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)

LINKS

Table of n, a(n) for n=1..11.

EXAMPLE

f(f(f(8))) = f(f(65)) = f(4226) = 17859077, a prime. Since 8, 65, 4226 are composite, then a(8) = 3.

CROSSREFS

Sequence in context: A187558 A327547 A233293 * A278105 A074063 A338211

Adjacent sequences:  A066743 A066744 A066745 * A066747 A066748 A066749

KEYWORD

more,sign

AUTHOR

Joseph L. Pe, Jan 16 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 11 18:00 EDT 2021. Contains 342888 sequences. (Running on oeis4.)