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!)
A268117 Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0. 0

%I #3 Jan 26 2016 17:18:54

%S 1,10,30,182,1687,24745,586844,22971957,1520467020

%N Number of nX(n+1) arrays of permutations of n+1 copies of 0..n-1 with every element equal to or 1 greater than any north or west neighbors modulo n and the upper left element equal to 0.

%C Superdiagonal 1 of A268115.

%e Some solutions for n=6

%e ..0..0..1..2..3..4..4....0..0..1..1..2..3..4....0..1..2..2..3..4..5

%e ..0..1..2..3..3..4..5....0..1..1..2..3..4..5....1..2..3..3..4..5..0

%e ..1..2..2..3..4..5..0....1..1..2..3..4..5..5....2..3..3..4..5..0..1

%e ..1..2..3..4..5..5..0....2..2..2..3..4..5..0....3..4..4..5..0..0..1

%e ..1..2..3..4..5..5..0....2..3..3..4..5..5..0....4..4..5..0..1..1..2

%e ..1..2..3..4..5..0..1....3..4..4..5..0..0..1....5..5..0..1..2..2..3

%Y Cf. A268115.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 26 2016

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 April 16 16:52 EDT 2024. Contains 371749 sequences. (Running on oeis4.)