|
%I #11 May 04 2021 14:33:43
%S 1,0,1,0,1,0,0,1,1,4,0,1,1,14,42,0,1,3,63,843,9050,0,1,3,224,7506,
%T 342743,6965359,0,1,8,1022,71542,6971973
%N Triangle read by rows: number of meanders filling out an n X k grid.
%C The sequence counts the distinct closed paths that visit every cell of an n-by-k rectangular lattice at least once, that never cross any edge between adjacent squares more than once, and that do not self-intersect. Paths related by rotation and/or reflection of the square lattice are not considered distinct.
%H Jon Wild, <a href="/A200893/a200893.png">Illustration for T(5,4) = 14</a>
%H Jon Wild, <a href="/A200893/a200893_1.png">Illustration for T(6,4)=63</a>
%H Jon Wild, <a href="/A200893/a200893_2.png">Illustration for T(7,4)=224</a>
%F T(n,3) appears to be equal to A090597.
%e The 14 solutions for (n,k)=(5,4), 63 solutions for (n,k)=(6,4) and 224 solutions for (n,k)=(7,4) are illustrated in the supporting png files.
%Y Cf. A200000 (sequence of entries for square grid).
%K nonn,tabl
%O 1,10
%A _Jon Wild_, Nov 23 2011
|
