 Euclid–Mullin sequence

The Euclid–Mullin sequence is a specific sequence of prime numbers that is generated through a recursive process. It starts with the initial prime number 2, and subsequent terms are formed based on the smallest prime that divides the product of all previously generated terms plus one. Here’s how it is generated: 1. Start with \( a_1 = 2 \).