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 A360916 #10 Feb 16 2025 08:34:04 %S A360916 1,1,1,1,4,1,1,2,2,1,1,6,8,6,1,1,2,14,14,2,1,1,8,18,84,18,8,1,1,2,2, %T A360916 26,26,2,2,1,1,10,4,32,56,32,4,10,1,1,2,6,16,4,4,16,6,2,1,1,12,8,152, %U A360916 24,136,24,152,8,12,1,1,2,10,48,32,10,10,32,48,10,2,1 %N A360916 Array read by antidiagonals: T(m,n) is the number of maximum induced paths in the grid graph P_m X P_n. %C A360916 A maximum induced path is an induced path of longest length. %C A360916 T(m,n) is the number of snake-like polyominoes with the maximum possible number of unit squares in an m X n rectangle. %H A360916 Andrew Howroyd, <a href="/A360916/b360916.txt">Table of n, a(n) for n = 1..435</a> %H A360916 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>. %F A360916 T(m,n) = T(n,m). %e A360916 Array begins: %e A360916 ======================================== %e A360916 m\n| 1 2 3 4 5 6 7 8 9 ... %e A360916 ---+------------------------------------ %e A360916 1 | 1 1 1 1 1 1 1 1 1 ... %e A360916 2 | 1 4 2 6 2 8 2 10 2 ... %e A360916 3 | 1 2 8 14 18 2 4 6 8 ... %e A360916 4 | 1 6 14 84 26 32 16 152 48 ... %e A360916 5 | 1 2 18 26 56 4 24 32 108 ... %e A360916 6 | 1 8 2 32 4 136 10 168 32 ... %e A360916 7 | 1 2 4 16 24 10 52 4 8 ... %e A360916 8 | 1 10 6 152 32 168 4 216 8 ... %e A360916 9 | 1 2 8 48 108 32 8 8 16 ... %e A360916 ... %Y A360916 Main diagonal is A331986. %Y A360916 Cf. A360199, A360913, A360917 (lengths), A360918. %K A360916 nonn,tabl %O A360916 1,5 %A A360916 _Andrew Howroyd_, Feb 26 2023