login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267337 Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0. 1
1, 3, 5, 12, 36, 135, 649, 4277, 39472, 505780, 9112713 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Diagonal of A267338.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267338.

Sequence in context: A087610 A243013 A191636 * A308544 A307142 A291936

Adjacent sequences:  A267334 A267335 A267336 * A267338 A267339 A267340

KEYWORD

nonn

AUTHOR

R. H. Hardin, Jan 13 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 09:46 EDT 2022. Contains 353975 sequences. (Running on oeis4.)