A319259
Minimal number of straight lines of a covering tree needed to cover n X n X n points arranged in a 3-D grid.
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”- A319259computable