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.
%I A375299 #13 Aug 19 2024 11:44:27 %S A375299 1,3,1,4,23,51,20,115,5568,12,3521,40,1058,2104,668,7540,1298,83648, %T A375299 16631833,70630 %N A375299 Number of longest winning paths in n X n Hex. %C A375299 A winning path is a set of cells connecting the top edge to the bottom edge, minimal with respect to inclusion. %H A375299 Peter Selinger, <a href="https://arxiv.org/abs/2408.05601">Longest winning paths in Hex</a>, arXiv:2408.05601 [math.CO], 2024. %e A375299 For n = 4, the longest winning path has length 8, and the a(4) = 4 winning paths of length 8 are %e A375299 ======== ======== ======== ======== %e A375299 X . . . . X . . X . . . . X . . %e A375299 X . X X X . X X X . X X X . X X %e A375299 X X . X X X . X X X . X X X . X %e A375299 . . . X . . . X . . X . . . X . %e A375299 ======== ======== ======== ======== %Y A375299 Length of longest path is A375298. %Y A375299 Cf. A357516. %K A375299 nonn,more %O A375299 1,2 %A A375299 _Peter Selinger_, Aug 13 2024