login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266860 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north or southwest neighbor modulo n and the upper left element equal to 0. 0
1, 0, 17, 999, 328701, 200359723, 215846101578, 368357739503591, 933148612656280367 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Column 3 of A266861.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A266861.

Sequence in context: A298302 A166188 A274548 * A221299 A258304 A221343

Adjacent sequences:  A266857 A266858 A266859 * A266861 A266862 A266863

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 04 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 September 18 09:59 EDT 2019. Contains 327170 sequences. (Running on oeis4.)