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!)
A264639 Number of 2Xn arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4. 0
1, 3, 28, 400, 7776, 229392, 9082368, 481406976, 30249676800, 2458667520000, 229405685760000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row 2 of A264638.

LINKS

Table of n, a(n) for n=1..11.

EXAMPLE

Some solutions for n=4

..4..2..6..5....4..0..6..5....2..0..4..5....4..0..2..1....2..0..4..1

..0..3..7..1....2..3..7..1....6..7..3..1....6..5..3..7....6..7..5..3

CROSSREFS

Cf. A264638.

Sequence in context: A161605 A048954 A086569 * A298696 A143636 A219532

Adjacent sequences:  A264636 A264637 A264638 * A264640 A264641 A264642

KEYWORD

nonn

AUTHOR

R. H. Hardin, Nov 19 2015

STATUS

approved

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 20 05:32 EST 2020. Contains 331067 sequences. (Running on oeis4.)