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 A112508 #2 Mar 31 2012 13:23:37 %S A112508 1,1,1,1,1,3,1,1,3,9,1,1,3,9,29,1,1,3,9,29,101 %N A112508 Counts the objects described in A047969 and A089246 when grouped by minimum part. (Row sums give A047970). %e A112508 Row 4 of the triangular array is (1 1 3 9) because there are nine tuples with a minimum value of 1, three tuples with a minimum value of 2, one tuple with a minimum value of 3 and one tuple with a minimum value of 4; the relevant unordered partitions are illustrated in the below Gaussian polynomial template: %e A112508 4 %e A112508 31 32 33 %e A112508 211 221 222 %e A112508 1111 %Y A112508 Cf. A047969, A089246. %K A112508 easy,nonn %O A112508 1,6 %A A112508 _Alford Arnold_, Sep 08 2005