A133378
a(1)=1. For n >= 2, a(n) = the largest prime divisor of (a(n-1)^a(n-1) + 1).
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”- A133378computable