The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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
 1, 3, 5, 9, 12, 16, 20, 25, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS I believe the next terms are 36, 41, 47, ... LINKS Table of n, a(n) for n=1..9. 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 Sequence in context: A061562 A006282 A086845 * A259368 A175098 A351389 Adjacent sequences: A243202 A243203 A243204 * A243206 A243207 A243208 KEYWORD more,nonn AUTHOR Gordon Hamilton, Jun 01 2014 EXTENSIONS Edited by N. J. A. Sloane, Jun 02 2014 Minor edits by M. F. Hasler, Mar 21 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 4 01:40 EDT 2024. Contains 374905 sequences. (Running on oeis4.)