|
|
A243205
|
|
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).
|
|
1
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
I believe the next terms are 36, 41, 47, ...
|
|
LINKS
|
Gordon Hamilton, Termite Terrorists: Children working on this problem in grade 2 classrooms. Published on YouTube.com, Jan 01 2013.
|
|
EXAMPLE
|
a(10) <= 36 because i + j = 18 + 18 = 36 in the left graph and i + j = 23 + 13 = 36 in the right graph. 36 may be the minimum.
-----X---- -----X----
----X----- -----X----
---X-X---- ---XX-X---
--X---X--- XXX----X--
-X-----X-X ---X----XX
X-X-----X- ----X--X--
---X---X-- ---X-X-X--
----X-X--- --X---X---
-----X---- -X----X---
----X----- X-----X---
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|