|
%I #6 Nov 10 2015 11:16:55
%S 8,125,1440,15488,168948,1903336,20768650,228712964,2514024565,
%T 27630491593,304037924437,3343529124864,36775469678400,
%U 404510148892477,4449339039778765,48939316077898664,538295657554650689
%N Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 1,-2 or 1,1.
%C Row 3 of A264142.
%H R. H. Hardin, <a href="/A264143/b264143.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A264143/a264143.txt">Empirical recurrence of order 67</a>
%F Empirical recurrence of order 67 (see link above)
%e Some solutions for n=4
%e ..0..1..5..3..4....0..1..2..3..4....0..1..2..6..4....0..1..5..6..7
%e ..2..6..7.14..9...11..6.10.14..9....5..3.10.14.12....2..3..4.14..9
%e .16..8.18.13.17....7..5.15.13..8...16..8..9..7.17...10..8.12.13.17
%e .15.10.11.12.19...12.16.17.18.19...15.13.11.18.19...15.16.11.18.19
%Y Cf. A264142.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 04 2015
| 