|
%I #6 Nov 10 2015 11:27:25
%S 4,40,441,2745,21025,167464,1336336,10277652,80568576,631845004,
%T 4952218384,38731564472,303450044769,2376946740975,18616368579561,
%U 145790870490104,1141923459200164,8943885706383975,70049807131516081
%N Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 0,2 or 1,1.
%C Row 2 of A264110.
%H R. H. Hardin, <a href="/A264112/b264112.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4
%e ..2..3..0..1..4....2..3..0..1..4....0..1..4..3..2....6..1..2..9..4
%e .11..6..7..8..9....5..8..7..6..9....5..6..7..8..9....5..0.13.14..3
%e .10..5.12.13.14...10.13.12.11.14...12.11.10.13.14...12.11.10..7..8
%Y Cf. A264110.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 03 2015
|
