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 A265000 #4 Aug 12 2016 07:05:15 %S A265000 1,2,7,29,140,758,4448,27782,182322,1245399,8793649,63844600, %T A265000 474662243,3601895485,27823860424,218325937188,1737070192604 %N A265000 Number of nX3 arrays containing 3 copies of 0..n-1 with rows and columns nondecreasing. %C A265000 Column 3 of A265005. %e A265000 Some solutions for n=4 %e A265000 ..0..0..1....0..0..2....0..0..2....0..0..1....0..0..0....0..0..1....0..1..1 %e A265000 ..0..1..2....0..1..3....0..1..3....0..1..2....1..1..2....0..2..3....0..2..2 %e A265000 ..1..2..3....1..2..3....1..1..3....1..2..2....1..2..2....1..2..3....0..2..3 %e A265000 ..2..3..3....1..2..3....2..2..3....3..3..3....3..3..3....1..2..3....1..3..3 %Y A265000 Cf. A265005. %K A265000 nonn %O A265000 1,2 %A A265000 _R. H. Hardin_, Nov 29 2015