cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Zhujun Zhang

Zhujun Zhang's wiki page.

Zhujun Zhang has authored 1 sequences.

A337207 a(n) is the minimal number of legal positions in Go played on connected graphs with n nodes.

Original entry on oeis.org

1, 5, 15, 41, 107, 273, 707, 1817, 4617, 11867, 30425, 76857, 197603, 505871, 1275465, 3276563, 8406527, 21165273, 54338627, 139513379, 351447657, 901789811, 2304725075, 5840498937, 14978318243, 38107010435, 97141424265, 248995117523, 630641012147
Offset: 1

Views

Author

Zhujun Zhang, Aug 19 2020

Keywords

Comments

Consider a Go game played on general graphs instead of grids. The position that each group has at least one liberty is called a legal position. 2^(n+1)-3 and 3^n-2^n are respectively the trivial lower bound and upper bound of this sequence. The Mathematics of Go interest group computed this sequence up to n=481.

Crossrefs

Cf. A094777, A102620, A266278, A268113, A327821.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.