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!)
A266865 Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its west or northeast neighbor modulo n and the upper left element equal to 0. 0
1, 0, 4, 72, 2760, 154240, 12199500, 1293877704, 177333949072, 30510421277760, 6439108605861780, 1635806769641077000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Column 2 of A266867.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A266867.

Sequence in context: A203264 A295383 A309980 * A327882 A003718 A012947

Adjacent sequences:  A266862 A266863 A266864 * A266866 A266867 A266868

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 December 3 14:51 EST 2020. Contains 338906 sequences. (Running on oeis4.)