Skip to content

A243205

OEIS Lean4

Consider the n X n Go board as a graph; remove i nodes and let j be the number of nodes in the largest connected subgraph remaining; then a(n) = minimum (i + j).

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