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!)
A267283 Number of nX(n+4) arrays of permutations of n+4 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0. 0
1, 462, 13767, 741057, 79348962, 13687472182 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Superdiagonal 4 of A267278.
LINKS
EXAMPLE
Some solutions for n=3
..0..0..0..1..2..2..0....0..1..2..0..0..1..2....0..0..1..1..2..2..0
..0..0..1..1..1..2..0....1..1..2..2..0..1..2....0..1..1..2..2..0..0
..2..1..1..1..2..2..2....0..1..2..0..0..1..2....1..0..2..1..2..2..1
CROSSREFS
Cf. A267278.
Sequence in context: A027816 A027823 A194718 * A289349 A023912 A027565
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 12 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 July 15 09:15 EDT 2024. Contains 374324 sequences. (Running on oeis4.)