|
%I #5 Dec 18 2015 18:18:26
%S 1,2,22,2470,16011558,3982479033010,167454529339944721318,
%T 448166024141727075228729619483
%N Number of n X n arrays with each row a permutation of 1..n having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order
%C Diagonal of A222005
%e Some solutions for n=3
%e ..2..1..3....2..3..1....2..3..1....3..1..2....3..1..2....2..3..1....2..1..3
%e ..2..1..3....2..3..1....2..1..3....2..1..3....3..1..2....2..3..1....2..1..3
%e ..1..3..2....2..3..1....1..3..2....2..1..3....3..1..2....1..3..2....2..1..3
%K nonn
%O 1,2
%A _R. H. Hardin_ Feb 03 2013
| 