OFFSET
1,5
COMMENTS
A maximum induced path is an induced path of longest length.
T(m,n) is the number of snake-like polyominoes with the maximum possible number of unit squares in an m X n rectangle.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..435
Eric Weisstein's World of Mathematics, Grid Graph.
FORMULA
T(m,n) = T(n,m).
EXAMPLE
Array begins:
========================================
m\n| 1 2 3 4 5 6 7 8 9 ...
---+------------------------------------
1 | 1 1 1 1 1 1 1 1 1 ...
2 | 1 4 2 6 2 8 2 10 2 ...
3 | 1 2 8 14 18 2 4 6 8 ...
4 | 1 6 14 84 26 32 16 152 48 ...
5 | 1 2 18 26 56 4 24 32 108 ...
6 | 1 8 2 32 4 136 10 168 32 ...
7 | 1 2 4 16 24 10 52 4 8 ...
8 | 1 10 6 152 32 168 4 216 8 ...
9 | 1 2 8 48 108 32 8 8 16 ...
...
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Andrew Howroyd, Feb 26 2023
STATUS
approved