Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #4 Dec 18 2012 09:11:01
%S 1,463,21195,2126423,168897201,14158198781,1166906554415,
%T 96567512189416,7981186640240601,659847172787561616,
%U 54547074666150602023,4509337888390693628506,372777382369854018831622
%N Number of ways to reciprocally link elements of an nX5 array either to themselves or to exactly two king-move neighbors, without consecutive collinear links
%C Column 5 of A220718
%H R. H. Hardin, <a href="/A220716/b220716.txt">Table of n, a(n) for n = 1..129</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.68.49.79.00...00.00.00.68.48...89.00.68.49.00...00.69.48.00.78
%e .00.29.38.16.14...68.48.69.24.27...29.18.29.69.14...68.47.12.38.27
%e .00.00.12.00.00...26.24.00.13.00...00.12.00.16.14...23.00.00.23.00
%K nonn
%O 1,2
%A _R. H. Hardin_ Dec 18 2012