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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267552 Number of nXn arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any north or northeast neighbors modulo n and the upper left element equal to 0. 1
1, 3, 6, 15, 55, 279, 2033, 21772, 345843, 8152180, 287657713 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Diagonal of A267553.

LINKS

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

EXAMPLE

Some solutions for n=4

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

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

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

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

CROSSREFS

Cf. A267553.

Sequence in context: A051169 A051610 A230950 * A241269 A102356 A208662

Adjacent sequences:  A267549 A267550 A267551 * A267553 A267554 A267555

KEYWORD

nonn

AUTHOR

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 19:55 EDT 2018. Contains 316378 sequences. (Running on oeis4.)