The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A308414 Minimal number of moves after which a group of stones of one color with exactly n liberties is possible on an infinite board in Go. 0
 7, 5, 3, 2, 1, 3, 3, 5, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Wikipedia, Go (game) EXAMPLE For n = 0: A white stone with 4 black stones adjacent to it has 0 liberties, which is possible after 7 moves, so a(0) = 7. For n = 1: A white stone with 3 black stones adjacent to it has 1 liberty, which is possible after 5 moves (3 of black and 2 of white), so a(1) = 5. For n = 2: A white stone with 2 black stones adjacent to it has 2 liberties, which is possible after 3 moves, so a(2) = 3. For n = 3: A black stone with a single white stone adjacent to it has 3 liberties, which is possible after 2 moves, so a(3) = 2. For n = 4: A single stone has 4 liberties, with that configuration possible after 1 move of black, so a(4) = 1. For n = 5: A group of 2 black stones adjacent to a single white stone has 5 liberties, which is possible after 3 moves, so a(5) = 3. For n = 6: A group of 2 black stones has 6 liberties, which is possible after 3 moves, so a(6) = 3. For n = 7: A group of 3 black stones in a straight line with a single adjacent white stone or a group of 3 black stones in an L-shape have 7 liberties, both of which are possible after 5 moves, so a(7) = 5. For n = 8: A group of 3 black stones in a straight line has 8 liberties, which is possible after 5 moves, so a(8) = 5. CROSSREFS Cf. A089071, A275346, A320666. Sequence in context: A219242 A330920 A155816 * A335985 A093824 A203142 Adjacent sequences:  A308411 A308412 A308413 * A308415 A308416 A308417 KEYWORD nonn,more AUTHOR Felix FrÃ¶hlich, May 25 2019 STATUS approved

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

Last modified October 26 11:29 EDT 2020. Contains 338027 sequences. (Running on oeis4.)