|
%I #8 Apr 11 2022 13:02:59
%S 64,7921,1464100,146410000,17394972100,2089022169025,252579343635025,
%T 30557658560100100,3696969485250250000,447272452462938576100,
%U 54112631066129736180025,6546741114347411138472025
%N Number of (n+1) X (7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 1,2 or 2,2.
%C Column 7 of A264017.
%H R. H. Hardin, <a href="/A264016/b264016.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 130*a(n-1) -1191*a(n-2) +13340*a(n-3) -146501*a(n-4) -159459*a(n-5) -1321*a(n-6) +1321*a(n-7) +159459*a(n-8) +146501*a(n-9) -13340*a(n-10) +1191*a(n-11) -130*a(n-12) +a(n-13) for n>15.
%e Some solutions for n=2
%e ..0.11.20..3.14.15..6..7....0..1.12..3.22..5..6..7...10..1..2..3.14.15..6..7
%e .18..9.10..1.22.13..4..5....8..9.20.11..2.23.14.15...18..9..0.21.12.23..4..5
%e .16.17..8.19..2.21.12.23...16.17.18.19.10.21..4.13...16.17..8.19.20.11.22.13
%Y Cf. A264017.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 01 2015
| 