login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081173 a(1) = 2, then a(n) = greatest prime factor of (a(n-1)^2+2). 2
2, 3, 11, 41, 17, 97, 3137, 13499, 60741001, 14158633, 7424699571433, 18375387908679124623224497, 152868746152697352174823427, 114585848725150699093848122619332057, 2117552824725684501808097956698634897, 34759922213207174486822944687721824905112848905750167403101021576017059, 57191433705834025254780615830990723253902440879104281100230506839641 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
REFERENCES
Teske, Edlyn and Williams, Hugh C., A note on Shanks's chains of primes, in Algorithmic number theory (Leiden, 2000), 563-580, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.
LINKS
EXAMPLE
a(2) = 3 because 3 is greatest prime factor of 2^2+2. a(3)=11 because 3^2+2 is prime.
MATHEMATICA
a[1]=2; a[n_] := a[n]=FactorInteger[a[n-1]^2+2][[ -1, 1]]
NestList[FactorInteger[#^2+2][[-1, 1]]&, 2, 15] (* Harvey P. Dale, Jun 21 2022 *)
CROSSREFS
Cf. A083388.
Sequence in context: A000280 A249402 A046224 * A179266 A265779 A055692
KEYWORD
nonn
AUTHOR
Donald S. McDonald, Apr 17 2003
EXTENSIONS
More terms from Donald S. McDonald, Apr 20 2003
More terms from Robert G. Wilson v and Dean Hickerson, Apr 22 2003
More terms from Dennis Langdeau (dlangdea(AT)sfu.ca), Jun 18 2006
Definition clarified by Harvey P. Dale, Jun 21 2022
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)