A220562 T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly one horizontal or antidiagonal neighbor.
1, 2, 1, 3, 5, 1, 5, 14, 13, 1, 8, 47, 64, 34, 1, 13, 149, 430, 292, 89, 1, 21, 481, 2604, 3966, 1332, 233, 1, 34, 1544, 16310, 45966, 36640, 6076, 610, 1, 55, 4965, 101052, 561636, 810778, 338581, 27716, 1597, 1, 89, 15957, 628269, 6743873, 19333688, 14298089
Offset: 1
Examples
Some solutions for n=3 k=4 0=self 3=ne 4=w 6=e 7=sw (reciprocal directions total 10) ..0..0..0..0....0..6..4..0....0..7..6..4....0..7..6..4....6..4..0..0 ..0..7..6..4....6..4..7..0....3..0..0..0....3..0..0..7....6..4..7..7 ..3..6..4..0....0..3..0..0....0..0..0..0....0..0..3..0....0..3..3..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..337
Comments