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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309514 Number of winning Tak paths on an n X n board. 0
1, 4, 14, 56, 302 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A "winning path" on any given Tak board is defined to be any path that connects one side of the grid to the opposite side, consistent with a path as defined by the rules of the game (see link), and which does not include within it a more direct winning path (a "shortcut").
The given terms (1, 4, 14, 56, 302) were generated by a combination of brute-force enumeration and generation by computer program (subsequently verified against an enumerated list).
Conjectured terms above n=5, generated by computer program, are 2012, 22574, 534312, 24816752, and 1908479044.
LINKS
James Ernest et al., Rules of Tak
CROSSREFS
Sequence in context: A346816 A006212 A126701 * A151884 A002735 A026652
KEYWORD
nonn,more
AUTHOR
Jakob Gowell, Aug 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)