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!)
A264711 Number of 3Xn arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 3 and columns nondecreasing modulo 6. 0
1, 4, 152, 8064, 789696, 120512448, 29928517632 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row 3 of A264709.

LINKS

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

EXAMPLE

Some solutions for n=4

..0..1..7.10....0..6.10..7....0..9..1..7....9..6..0..7....0..9..4..7

..6..8..2.11....9..1..4..8....6..4.11..8....3..1..8..2....6..3.10..1

..3..9..4..5....3.11..5..2....3.10..5..2...10..4..5.11....8..5.11..2

CROSSREFS

Cf. A264709.

Sequence in context: A294826 A247115 A006439 * A279325 A158104 A244448

Adjacent sequences:  A264708 A264709 A264710 * A264712 A264713 A264714

KEYWORD

nonn

AUTHOR

R. H. Hardin, Nov 21 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 4 02:40 EST 2021. Contains 349469 sequences. (Running on oeis4.)