A084934 - OEIS

%I #5 Mar 30 2012 18:57:05

%S 0,1,0,1,1,0,2,2,1,0,2,2,2,1,0,2,3,3,2,1,0,3,3,3,3,2,1,0,3,4,4,4,3,2,

%T 1,0,3,4,4,4,4,3,2,1,0,3,4,5,5,5,4,3,2,1,0,4,5,5,5,5,5,4,3,2,1,0,4,5,

%U 6,6,6,6,5,4,3,2,1,0,4,5,6,6,6,6,6,5,4,3,2,1,0,4,6,6,7,7,7,7,6,5,4,3,2,1,0

%N Rectangular array T(m,n) (m>=1, n>=1) read by antidiagonals: row m consists of the numbers ( i + mj : i >= 0, j >= 0 ), sorted in increasing order, with repetitions allowed.

%C The combinatorial limit of the rows is the sequence of nonnegative integers.

%F For k>=0, the number of k's in row m is [(k+1)/m].

%e The northwest corner includes

%e m\n 1 2 3 4 5 6 7 8 9 10 ...

%e ----------------------------

%e 1 | 0 1 1 2 2 2 3 3 3 3 ...

%e 2 | 0 1 2 2 3 3 4 4 4 5 ...

%e 3 | 0 1 2 3 3 4 4 5 5 6 ...

%e 4 | 0 1 2 3 4 4 5 5 6 6 ...

%e 5 | 0 1 2 3 4 5 5 6 6 7 ...

%e Row m=0, for example, consists of the numbers i+j (i>=0, j>=0), sorted.

%Y Cf. A010766, A084934.

%K nonn,tabl

%O 1,7

%A _Clark Kimberling_, Jun 12 2003

%E Edited by _N. J. A. Sloane_, May 19 2007