%I #4 Dec 18 2012 12:48:54
%S 1,221,10653,824965,60293428,4335687696,319803318494,23223803317197,
%T 1694411878011549,123510214821475772,9003987952938394208,
%U 656405668520539476077,47851358998828374751289,3488414479767358266768461
%N Number of ways to reciprocally link elements of an nX7 array either to themselves or to exactly two horizontal, diagonal and antidiagonal neighbors, without consecutive collinear links
%C Column 7 of A220738
%H R. H. Hardin, <a href="/A220737/b220737.txt">Table of n, a(n) for n = 1..115</a>
%e Some solutions for n=3 0=self 1=nw 3=ne 4=w 6=e 7=sw 9=se (reciprocal directions total 10)
%e .00.67.49.00.00.79.00...00.79.79.79.00.00.00...00.67.47.00.00.00.00
%e .39.00.79.17.39.67.14...39.39.13.16.14.69.47...39.39.79.00.00.00.00
%e .00.13.36.14.36.14.00...00.16.14.00.00.36.14...00.13.16.14.00.00.00
%K nonn
%O 1,2
%A _R. H. Hardin_ Dec 18 2012