Primes Generated by Recurrence Sequences

@article{Everest2007PrimesGB,
  title={Primes Generated by Recurrence Sequences},
  author={G. Everest and S. Stevens and D. Tamsett and T. Ward},
  journal={The American Mathematical Monthly},
  year={2007},
  volume={114},
  pages={417 - 431}
}
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density. We discuss two heuristic arguments to suggest a value for that density, one using recent advances made about the distribution of roots of polynomial congruences. 
PRIMITIVE PRIME DIVISORS IN POLYNOMIAL ARITHMETIC DYNAMICS
Primitive Prime Divisors of First-Order Polynomial Recurrence Sequences
Number Theory and Polynomials: On primitive divisors of n 2 + b
On primitive divisors of n^2+b
The arithmetic of consecutive polynomial sequences over finite fields
Primitive Divisors of some Lehmer-Pierce Sequences
Primitive Divisors on Twists of Fermat's Cubic
A simple prime-generating recurrence
On a Family of Sequences Related to Chebyshev Polynomials
...
1
2
3
...