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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267329 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 southwest or northwest neighbors modulo n and the upper left element equal to 0. 0

%I

%S 1,10,15,22,30,38,46,54,62,70,78,86

%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 southwest or northwest neighbors modulo n and the upper left element equal to 0.

%C Superdiagonal 1 of A267328.

%e Some solutions for n=4

%e ..0..1..2..3..0....0..1..2..3..0....0..0..1..1..2....0..1..2..3..0

%e ..0..1..2..3..3....0..1..2..3..0....3..0..1..2..2....1..1..2..3..0

%e ..0..1..2..2..3....1..1..2..3..0....3..0..1..2..3....1..2..2..3..0

%e ..0..1..1..2..3....1..2..2..3..3....3..0..1..2..3....1..2..3..3..0

%Y Cf. A267328.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 13 2016

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 September 15 22:10 EDT 2019. Contains 327088 sequences. (Running on oeis4.)