|
%I #5 Aug 12 2016 06:54:00
%S 1,1,2,2,4,9,24,89,594,4086,39921
%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 north, west or southwest neighbors modulo n and the upper left element equal to 0.
%C Subdiagonal 1 of A267338.
%e Some solutions for n=7
%e ..0..1..2..3..4..4..5....0..0..1..1..2..2..3....0..1..2..3..4..4..5
%e ..1..2..3..3..4..5..6....0..0..1..1..2..3..4....1..2..3..3..4..5..6
%e ..2..2..3..4..5..6..7....0..0..1..2..3..4..5....2..3..3..4..5..6..7
%e ..2..3..4..5..6..7..0....0..1..2..3..4..5..6....2..3..4..5..6..7..0
%e ..3..4..5..6..7..0..1....1..2..3..4..5..6..7....3..4..5..6..7..0..1
%e ..4..5..6..7..0..1..1....2..3..4..5..6..6..7....4..5..6..7..0..1..2
%e ..5..6..7..0..0..1..2....3..4..5..6..6..7..7....5..6..7..0..0..1..2
%e ..6..7..7..0..1..2..3....4..5..5..6..7..7..7....6..7..7..0..1..1..2
%Y Cf. A267338.
%K nonn
%O 1,3
%A _R. H. Hardin_, Jan 13 2016
| 