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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264641 Number of nX2 arrays of permutations of 0..n*2-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 4. 0
1, 1, 6, 30, 284, 2344, 31632, 492432, 12098624, 236007424, 6065647616, 159458086912, 6086725226496, 260007588237312 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Column 2 of A264643.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A264643.

Sequence in context: A205339 A215288 A295611 * A110374 A232978 A332041

Adjacent sequences:  A264638 A264639 A264640 * A264642 A264643 A264644

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 December 3 15:47 EST 2021. Contains 349464 sequences. (Running on oeis4.)