|
%I #6 Aug 11 2014 22:45:50
%S 120,6322,207262,4907711,91075868,1393742886,18203084280,207961261268,
%T 2116883443548,19475385665260,163788555854232,1270883781907016,
%U 9168186853827174,61890082396969113,393107547309424404
%N Number of nX5 arrays with each row a permutation of 1..5 having at least as many downsteps as the preceding row, with rows in lexicographically nondecreasing order
%C Column 5 of A222159
%H R. H. Hardin, <a href="/A222157/b222157.txt">Table of n, a(n) for n = 1..210</a>
%H R. H. Hardin, <a href="/A222157/a222157.txt">Formula for A222157</a>
%F See link for formula
%e Some solutions for n=3
%e ..2..3..5..1..4....1..2..5..3..4....1..5..2..3..4....3..4..2..1..5
%e ..5..1..2..4..3....3..5..1..4..2....3..5..2..1..4....5..3..2..1..4
%e ..5..1..3..4..2....5..2..3..4..1....4..3..2..5..1....5..4..2..1..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 10 2013
| 