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!)
A266597 Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its north or northeast neighbor modulo n and the upper left element equal to 0. 0
1, 0, 2, 38, 1197, 64497, 4975742, 519665920, 70425165645, 12012958306121, 2518082525423953, 636165450001831755 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Column 2 of A266599.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A266599.

Sequence in context: A230903 A246000 A266601 * A291821 A187544 A187545

Adjacent sequences:  A266594 A266595 A266596 * A266598 A266599 A266600

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 April 5 20:22 EDT 2020. Contains 333260 sequences. (Running on oeis4.)