This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A084934 #5 Mar 30 2012 18:57:05 %S A084934 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 A084934 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 A084934 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 A084934 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 A084934 The combinatorial limit of the rows is the sequence of nonnegative integers. %F A084934 For k>=0, the number of k's in row m is [(k+1)/m]. %e A084934 The northwest corner includes %e A084934 m\n 1 2 3 4 5 6 7 8 9 10 ... %e A084934 ---------------------------- %e A084934 1 | 0 1 1 2 2 2 3 3 3 3 ... %e A084934 2 | 0 1 2 2 3 3 4 4 4 5 ... %e A084934 3 | 0 1 2 3 3 4 4 5 5 6 ... %e A084934 4 | 0 1 2 3 4 4 5 5 6 6 ... %e A084934 5 | 0 1 2 3 4 5 5 6 6 7 ... %e A084934 Row m=0, for example, consists of the numbers i+j (i>=0, j>=0), sorted. %Y A084934 Cf. A010766, A084934. %K A084934 nonn,tabl %O A084934 1,7 %A A084934 _Clark Kimberling_, Jun 12 2003 %E A084934 Edited by _N. J. A. Sloane_, May 19 2007