Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #3 Nov 20 2015 07:26:37
%S 2,16,314,8944,437568,31791360,3066123264
%N Number of nX3 arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 5.
%C Column 3 of A264659.
%e Some solutions for n=5
%e ..0..5..1....0..7..5....0.11..5....0.11..5....0..1..5....0..2..6....0..2..5
%e .10..6.11...10.12.11...10.12..1...10..6.13...10..6.12...10.12.11...10.12.11
%e .12..2..7....6.14..8....8..2..6....7..1..3...11..7..3....5..7.13....6..3..7
%e .13..3..9....1..9..3....9..3..7...12..2..8....2..9.13....1..3..9....1..9.13
%e .14..8..4....2..4.13...14..4.13...14..4..9....8..4.14...14..8..4....8..4.14
%Y Cf. A264659.
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 20 2015