Skip to content

A263429

OEIS Lean4

Smallest prime p such that binomial(2*p-1, p-1) == 1 (mod p^n), or 0 if no such p exists.

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.

low confidence