login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of nX4 arrays containing 4 indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing
0

%I #2 Mar 31 2012 12:35:48

%S 1,0,44,14284,8554238,9893281255,19903018463755

%N Number of nX4 arrays containing 4 indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing

%C Column 4 of A180843

%e Some solutions for 3X4

%e ..2..1..1..1....2..1..1..1....2..1..1..1....2..1..1..1....2..1..1..1

%e ..2..3..2..1....2..3..2..1....2..3..2..1....2..3..2..1....2..3..3..1

%e ..2..3..3..3....3..2..3..3....3..3..3..2....3..3..2..3....3..3..2..2

%e ...

%e ..2..1..1..1....2..1..1..1....2..1..1..1....2..1..1..1....2..2..1..1

%e ..2..3..2..2....2..3..3..2....2..3..3..2....2..3..3..2....2..2..3..1

%e ..3..3..3..1....3..2..1..3....3..3..1..2....3..3..2..1....3..1..3..3

%e ...

%e ..2..2..1..1....2..1..1..1....2..1..1..1....2..2..1..1....2..2..1..1

%e ..2..2..3..3....3..2..2..1....3..3..2..1....3..1..2..1....3..1..2..1

%e ..3..1..3..1....3..3..2..3....3..3..2..2....3..2..3..3....3..3..3..2

%K nonn

%O 1,3

%A _R. H. Hardin_ Sep 20 2010