login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264637 Number of nX3 arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4. 0

%I

%S 2,28,960,46656,4561920,829440000,218972160000,73903104000000

%N Number of nX3 arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4.

%C Column 3 of A264638.

%e Some solutions for n=4

%e ..8..0..9....8..4..0....4..8..0....4.10..9....0..4..8....0..4..9....2..8..4

%e ..6..4..1...10..5..9...10..6..1....0..6..5....6..1..5...10..8..5...10..0..5

%e .10..2..5....2..6..1....2..3..9....8..2..1....2..9..7....2..7..1....6.11..1

%e ..3.11..7....7..3.11...11..7..5....3..7.11...10.11..3....6.11..3....3..7..9

%Y Cf. A264638.

%K nonn

%O 1,1

%A _R. H. Hardin_, Nov 19 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 12:18 EST 2020. Contains 330958 sequences. (Running on oeis4.)