|
%I #7 Jul 31 2018 14:52:03
%S 8,149,2604,45966,810778,14298089,252139015,4446314533,78407942556,
%T 1382674335890,24382584703194,429971411669361,7582273047532603,
%U 133708574584054949,2357865880743076540,41579468847568886038
%N Number of ways to reciprocally link elements of an n X 5 array either to themselves or to exactly one horizontal or antidiagonal neighbor.
%C Column 5 of A220562.
%H R. H. Hardin, <a href="/A220559/b220559.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 21*a(n-1) - 62*a(n-2) + 47*a(n-3) - 5*a(n-4) for n>5.
%F Empirical g.f.: x*(8 - 19*x - 29*x^2 + 144*x^3 - 23*x^4) / ((1 - x)*(1 - 20*x + 42*x^2 - 5*x^3)). - _Colin Barker_, Jul 31 2018
%e Some solutions for n=3 0=self 3=ne 4=w 6=e 7=sw (reciprocal directions total 10):
%e ..0..0..0..6..4....0..0..0..6..4....0..0..0..6..4....0..0..6..4..0
%e ..6..4..0..6..4....0..6..4..0..0....0..6..4..7..0....0..7..7..7..0
%e ..0..6..4..0..0....0..6..4..0..0....0..0..3..0..0....3..3..3..0..0
%Y Cf. A220562.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 16 2012
| 