Answer:
2
Explanation:
You want the largest possible greatest common divisor of consecutive terms of the sequence an = n! +n.
Sequence
The sequence starts off 2, 4, 9, 28, 125, ...
The first two terms have a GCD of 2. The remaining pairs of terms have a GCD of 1.
The maximum possible GCD of adjacent terms is 2.
<95141404393>