|
%I #6 Nov 10 2015 11:23:14
%S 32,715,24010,645627,19553300,563080476,16552783250,482814424352,
%T 14123641492708,412725000738113,12065211359731474,352657465358164133,
%U 10308383273045021344,301315437813209402479,8807536884627506726938
%N Number of (4+1)X(n+1) arrays of permutations of 0..n*5+4 with each element having index change +-(.,.) 0,0 0,1 or 2,-2.
%C Row 4 of A264090.
%H R. H. Hardin, <a href="/A264093/b264093.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A264093/a264093.txt">Empirical recurrence of order 52</a>
%F Empirical recurrence of order 52 (see link above)
%e Some solutions for n=3
%e ..1..0..3..9....1..0..2..3....0..1..3..2....0..1..2..9....0..1..2..3
%e ..5..4.12..6....5..4..6.13....4..6..5..7....4..5..6..7....4..5..7..6
%e ..2..8.16.10....8..9.16.10....9..8.10.11....8..3.10.17....9..8.10.17
%e .13..7.14.15...12..7.14.15...13.12.15.14...12.13.14.15...13.12.15.14
%e .17.11.19.18...17.11.18.19...16.17.18.19...16.11.18.19...16.11.19.18
%Y Cf. A264090.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015
| 