A220632 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal or antidiagonal neighbors.
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 1, 8, 12, 5, 1, 1, 1, 16, 44, 37, 8, 1, 1, 1, 32, 158, 257, 114, 13, 1, 1, 1, 64, 564, 1665, 1481, 351, 21, 1, 1, 1, 128, 2010, 10695, 17527, 8560, 1081, 34, 1, 1, 1, 256, 7160, 68637, 201903, 183961, 49448, 3329, 55, 1, 1, 1, 512
Offset: 1
Examples
Some solutions for n=3 k=4 0=self 3=ne 4=w 6=e 7=sw (reciprocal directions total 10) .00.67.46.47...00.67.46.47...00.67.47.00...00.00.00.00...00.00.67.47 .36.46.34.00...36.47.36.47...36.34.00.00...00.00.00.00...00.37.36.47 .00.00.00.00...36.46.34.00...00.00.00.00...00.00.00.00...36.46.34.00
Links
- R. H. Hardin, Table of n, a(n) for n = 1..287
Comments