A220644 T(n,k) = number of ways to reciprocally link elements of an n X k array either to themselves or to exactly one king-move neighbor.
1, 2, 2, 3, 10, 3, 5, 40, 40, 5, 8, 172, 369, 172, 8, 13, 728, 3755, 3755, 728, 13, 21, 3096, 37320, 92801, 37320, 3096, 21, 34, 13152, 373177, 2226936, 2226936, 373177, 13152, 34, 55, 55888, 3725843, 53841725, 128171936, 53841725, 3725843, 55888, 55, 89
Offset: 1
Examples
Some solutions for n=3 k=4 0=self 1=nw 2=n 3=ne 4=w 6=e 7=sw 8=s 9=se (reciprocal directions total 10) ..0..6..4..8....6..4..0..0....8..0..0..0....9..6..4..8....6..4..0..0 ..0..7..7..2....8..0..9..7....2..8..8..0....8..1..9..2....0..0..8..8 ..3..3..6..4....2..0..3..1....0..2..2..0....2..6..4..1....0..0..2..2
Links
- Alois P. Heinz, Table of n, a(n) for n = 1..528 (antidiagonals 1..32) (terms n = 1..180 from R. H. Hardin)
Comments