Skip to content

A321518

OEIS Lean4

Smallest k > 1 such that n^k + k^n is prime, i.e., a Leyland prime, or 0 if no such k exists.

offset: 2
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.

low confidence