GFP

Search for Generalized Fermat Progressions

About

Let b be a positive integer. A GFP-n is any sequence of n primes such that b^2k + 1 are primes for 0 ≤ k ≤ n - 1.
b is the generator of the progression.

GFP is a set of C++ applications.
Each program searches for a fixed-length GFP-n.

If g_n > 1 is the smallest generator of any GFP-n then
g₁ = g₂ = g₃ = g₄ = g₅ = 2 (the Fermat primes).
g₆ = 7072833120 (from Yves Gallot, May 16 2001).
g₇ = 2072005925466 (from Jens Kruse Andersen, May 06 2007).
g₈ = 240164550712338756 (from Kellen Shenton, Aug 13 2020).

This integer sequence is https://oeis.org/A090872.