cp's OEIS Frontend

A215872 Number of permutations of 0..floor((4*n-2)/2) on odd squares of an 4Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.

%I A215872 #7 Jul 22 2025 23:26:06
%S A215872 1,1,1,4,10,78,262,3001,11694,170594,727846,12517074,56797272,
%T A215872 1100044792,5219906670,110598847073,542976951374,12341741030502
%N A215872 Number of permutations of 0..floor((4*n-2)/2) on odd squares of an 4Xn array such that each row, column, diagonal and (downwards) antidiagonal of odd squares is increasing.
%C A215872 Row 4 of A215870
%e A215872 Some solutions for n=5
%e A215872 ..x..0..x..2..x....x..0..x..2..x....x..0..x..2..x....x..0..x..2..x
%e A215872 ..1..x..3..x..5....1..x..3..x..5....1..x..3..x..6....1..x..3..x..4
%e A215872 ..x..4..x..6..x....x..4..x..7..x....x..4..x..7..x....x..5..x..7..x
%e A215872 ..7..x..8..x..9....6..x..8..x..9....5..x..8..x..9....6..x..8..x..9
%K A215872 nonn
%O A215872 1,4
%A A215872 _R. H. Hardin_ Aug 25 2012