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 A112995 #2 Mar 30 2012 18:57:06 %S A112995 1,1,2,2,2,3,3,4,4,5,5,6,6,6,7,7,9,10,10,10,11,11,13,14,14,14,14,15, %T A112995 15,19,20,21,21,21,21,22,22,26,28,29,29,29,29,29,30,30,37,39,40,41,41, %U A112995 41,41,41,42,42,50,53,54,55,55,55,55,55,55,56,56,68,72,74,75,76,76,76,76 %N A112995 Triangular array T(n,k)=number of partitions of n in which the least part is <=k, for 1<=k<=n, n>=1. %C A112995 The partition sequence A000041 occurs here as T(n,0) and also essentially as T(n,n). %F A112995 Row n of T consists of the partial sums of row n of the array in A026794. %e A112995 The first five rows: %e A112995 1 %e A112995 1 2 %e A112995 2 2 3 %e A112995 3 4 4 5 %e A112995 5 6 6 6 7 %e A112995 Row 5 of A026794, namely 5 1 0 0 1, has partial sums 5 6 6 6 7. %Y A112995 Cf. A000041, A026794. %K A112995 nonn,tabl %O A112995 1,3 %A A112995 _Clark Kimberling_, Oct 08 2005