A087280
Solutions n of max(m+d(m))=n+2 for m<n; d(m) is the number of divisors of m.
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”- A087280computable