Skip to content

A003035

OEIS Lean4

Maximal number of 3-tree rows in n-tree orchard problem.

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
n1234567891011121314
A00303500112467101216192226