A220614 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal and vertical neighbors, without consecutive collinear links.
1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 5, 5, 5, 1, 1, 8, 11, 11, 8, 1, 1, 13, 21, 36, 21, 13, 1, 1, 21, 43, 95, 95, 43, 21, 1, 1, 34, 85, 281, 324, 281, 85, 34, 1, 1, 55, 171, 781, 1277, 1277, 781, 171, 55, 1, 1, 89, 341, 2245, 4673, 7041, 4673, 2245, 341, 89, 1, 1, 144, 683, 6336
Offset: 1
Examples
Some solutions for n=3 k=4 0=self 2=n 4=w 6=e 8=s (reciprocal directions total 10) .00.00.68.48...68.48.68.48...68.48.00.00...00.00.00.00...00.68.48.00 .00.00.26.24...26.24.26.24...26.24.00.00...00.00.00.00...00.26.24.00 .00.00.00.00...00.00.00.00...00.00.00.00...00.00.00.00...00.00.00.00
Links
- R. H. Hardin, Table of n, a(n) for n = 1..544
Comments