A283051
Positive integers n such that none of the primes of the form k*2^n + 1 (with k odd) divide any Fermat number F(m) = 2^(2^m) + 1, m >= 0.
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A283051computable