login

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

T(n,k)=number of nXk arrays containing k indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing
3

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

%S 1,1,1,1,0,1,1,1,2,1,1,0,19,17,1,1,0,44,596,131,1,1,0,98,14284,37423,

%T 1220,1,1,0,189,312424,8554238,3746117,13796,1,1,0,298,6236734,

%U 1867529572,9893281255,545626043,183095,1,1,0,379,113114480,388782928110

%N T(n,k)=number of nXk arrays containing k indistinguishable copies of 1..n with lexicographical ordering of rows strictly increasing and columns strictly decreasing

%C Table starts

%C .1......1.........1..........1..........1............1.........1...1.1.1

%C .1......0.........1..........0..........0............0.........0...0.0

%C .1......2........19.........44.........98..........189.......298.379

%C .1.....17.......596......14284.....312424......6236734.113114480

%C .1....131.....37423....8554238.1867529572.388782928110

%C .1...1220...3746117.9893281255

%C .1..13796.545626043

%C .1.183095

%C .1

%K nonn,tabl

%O 1,9

%A _R. H. Hardin_ Sep 20 2010