A118710
Smallest positive integer k such that k^k + F(n) is prime, where F(n) is the n-th Fibonacci number.
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”- A118710computable