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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A266859 Number of nX2 arrays containing 2 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, 4, 39, 1281, 67240, 5126572, 531096757, 71602080252, 12170470180300, 2544668908965896, 641689032354740060 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Column 2 of A266861.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A266861.

Sequence in context: A086217 A203197 A094156 * A049475 A264084 A080271

Adjacent sequences:  A266856 A266857 A266858 * A266860 A266861 A266862

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 August 4 14:53 EDT 2021. Contains 346447 sequences. (Running on oeis4.)