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.

Showing 1-1 of 1 results.

A375299 Number of longest winning paths in n X n Hex.

Original entry on oeis.org

1, 3, 1, 4, 23, 51, 20, 115, 5568, 12, 3521, 40, 1058, 2104, 668, 7540, 1298, 83648, 16631833, 70630
Offset: 1

Views

Author

Peter Selinger, Aug 13 2024

Keywords

Comments

A winning path is a set of cells connecting the top edge to the bottom edge, minimal with respect to inclusion.

Examples

			For n = 4, the longest winning path has length 8, and the a(4) = 4 winning paths of length 8 are
   ========     ========     ========     ========
    X . . .      . X . .      X . . .      . X . .
     X . X X      X . X X      X . X X      X . X X
      X X . X      X X . X      X X . X      X X . X
       . . . X      . . . X      . . X .      . . X .
       ========     ========     ========     ========

Links

Crossrefs

Length of longest path is A375298.
Cf. A357516.
Showing 1-1 of 1 results.

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

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