Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Jan 04 2019 14:44:19
%S 80,1040,13600,178000,2330000,30500000,399250000,5226250000,
%T 68412500000,895531250000,11722656250000,153451562500000,
%U 2008707031250000,26294316406250000,344197070312500000,4505598144531250000
%N Number of (n+1) X (4+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 0,2 or 1,2.
%H R. H. Hardin, <a href="/A264129/b264129.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 15*a(n-1) - 25*a(n-2).
%F Empirical g.f.: 80*x*(1 - 2*x) / (1 - 15*x + 25*x^2). - _Colin Barker_, Jan 04 2019
%e Some solutions for n=4:
%e ..0..8..4..3..2....0..3..9..1..4....0..1..4..3..2....0..8..2..3..4
%e ..5.13..7..1..9....5..6.14..8..2....5..6..9..8..7...12.13.14..1..9
%e .10.11.14..6.12...17.13.12.11..7...12.11.10.13.14...10.18..5..6..7
%e .15.16.19.18.17...15.23.10.18.19...22.18.17.16.19...22.16.24.11.19
%e .20.21.24.23.22...20.21.22.16.24...20.23.15.21.24...20.21.15.23.17
%Y Column 4 of A264131.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015