A220708 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal and antidiagonal neighbors, without consecutive collinear links.
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 5, 6, 5, 1, 1, 1, 8, 12, 13, 8, 1, 1, 1, 13, 24, 37, 28, 13, 1, 1, 1, 21, 48, 105, 107, 60, 21, 1, 1, 1, 34, 96, 298, 405, 317, 129, 34, 1, 1, 1, 55, 192, 846, 1520, 1617, 932, 277, 55, 1, 1, 1, 89, 384, 2404, 5706, 8338, 6412, 2749, 595
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.47.00...00.00.00.00...00.00.67.47...00.00.00.00...00.67.47.00 .36.34.00.00...00.00.00.00...00.36.34.00...00.00.67.47...36.34.67.47 .00.00.00.00...00.00.00.00...00.00.00.00...00.36.34.00...00.36.34.00
Links
- R. H. Hardin, Table of n, a(n) for n = 1..391
Comments