|
%I #5 Aug 12 2016 06:54:01
%S 1,2,3,3,8,17,76,424,6402,82456,2772850
%N Number of (n+1)Xn arrays containing n copies of 0..n+1-1 with every element equal to or 1 greater than any west or southwest neighbors modulo n and the upper left element equal to 0.
%C Subdiagonal 1 of A267562.
%e Some solutions for n=5
%e ..0..1..2..2..3....0..1..2..3..4....0..0..1..1..2....0..0..0..0..0
%e ..0..1..2..3..4....1..2..3..4..5....0..0..1..2..3....5..5..5..5..5
%e ..1..2..3..4..5....2..3..4..5..0....0..1..2..3..4....4..4..4..4..4
%e ..2..3..4..5..0....3..4..5..0..1....1..2..3..4..5....3..3..3..3..3
%e ..3..4..5..0..1....4..5..0..1..2....2..3..4..5..5....2..2..2..2..2
%e ..4..5..5..0..1....5..0..1..2..3....3..4..4..5..5....1..1..1..1..1
%Y Cf. A267562.
%K nonn
%O 1,2
%A _R. H. Hardin_, Jan 17 2016
| 