|
%I #4 Dec 18 2012 09:11:46
%S 1,1930,201598,63806966,14158198781,3503850286857,837962999003819,
%T 202559596688263771,48800208840366180607,11769507869511009093649,
%U 2837567849598052498110938,684198360972218804926155379
%N Number of ways to reciprocally link elements of an nX6 array either to themselves or to exactly two king-move neighbors, without consecutive collinear links
%C Column 6 of A220718
%H R. H. Hardin, <a href="/A220717/b220717.txt">Table of n, a(n) for n = 1..31</a>
%e Some solutions for n=3 0=self 1=nw 2=n 3=ne 4=w 6=e 7=sw 8=s 9=se (reciprocal directions total 10)
%e .00.00.68.48.00.78...00.67.48.68.49.00...00.68.49.79.79.00...00.69.49.00.78.00
%e .69.48.29.27.36.24...36.48.27.27.67.14...00.26.34.13.18.17...00.79.17.13.27.78
%e .00.12.36.14.00.00...00.23.36.34.00.00...00.00.00.00.23.00...36.34.16.34.36.24
%K nonn
%O 1,2
%A _R. H. Hardin_ Dec 18 2012
| 