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!)
A264636 Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 4. 0
1, 3, 16, 128, 1152, 12960, 269568, 6635520, 165888000, 4561920000, 209018880000, 10480803840000, 513559388160000, 26454892584960000, 2106067546275840000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 2 of A264638.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

..3..7....6..3....3..7....1..7....2..3....7..3....3..7....3..7....3..7....6..7

CROSSREFS

Cf. A264638.

Sequence in context: A296535 A088358 A082161 * A208829 A289145 A135752

Adjacent sequences:  A264633 A264634 A264635 * A264637 A264638 A264639

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 23 13:49 EST 2020. Contains 331171 sequences. (Running on oeis4.)