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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266631 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, west, southeast or southwest neighbor modulo n and the upper left element equal to 0. 0
1, 0, 1, 64, 6342, 3030929, 3232725244, 5451050692400 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

COMMENTS

Column 3 of A266632.

LINKS

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

EXAMPLE

Some solutions for n=4

..0..2..1....0..3..1....0..0..2....0..0..2....0..2..1....0..2..1....0..2..0

..3..2..0....0..2..1....0..2..1....2..0..2....3..2..0....2..1..3....2..0..2

..3..1..3....3..1..3....2..1..3....1..3..1....3..1..0....1..0..3....1..3..1

..1..0..2....2..0..2....1..3..3....3..1..3....2..1..3....0..3..2....1..3..3

CROSSREFS

Cf. A266632.

Sequence in context: A009823 A222100 A223265 * A085525 A264188 A333583

Adjacent sequences:  A266628 A266629 A266630 * A266632 A266633 A266634

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 01 2016

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 November 24 04:49 EST 2020. Contains 338607 sequences. (Running on oeis4.)