|
%I #6 Nov 10 2015 11:20:43
%S 169,8788,456976,19553300,836655625,35960283125,1545608400625,
%T 66425039324500,2854724293344400,122686726306616820,
%U 5272674789270374721,226602328913809523253,9738627455964881203129,418534378290010327242292
%N Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.
%C Column 5 of A264090.
%H R. H. Hardin, <a href="/A264087/b264087.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 43*a(n-1) -a(n-2) +1848*a(n-4) -79464*a(n-5) +1848*a(n-6) -1848*a(n-8) +79464*a(n-9) -1848*a(n-10) +a(n-12) -43*a(n-13) +a(n-14)
%e Some solutions for n=2
%e ..1..0.12..3..5..4....0..1.12.13.14..4....1..0.12..2..4..5....0..1..2..3..5.15
%e ..6..8..7.10..9.11....6..7..9..8.10.11....6..8..7.10..9.11....6..7..9..8.10.11
%e ..2.13.14.16.15.17....2..3.15..5.16.17...13..3.14.16.15.17...12.13..4.14.16.17
%Y Cf. A264090.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015
| 