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 A264032 #5 Nov 25 2015 21:34:03 %S A264032 1,1,2,2,1,2,1,2,2,0,0,4,1,2,0,0,2,2,2,2,1,2,0,0,0,0,2,2,2,4,1,0,2,2, %T A264032 0,0,0,0,0,4,0,0,4,3,0,2,2,2,2,0,1,2,0,0,0,0,0,0,2,0,0,3,2,4,0,0,4,1, %U A264032 0,4,2,2,0,2,2,2,0,0,0,0,0,0,0,2,0,2,0,0,2,4,2,0,0,2,2,4,0,0,6,2,0,4 %N A264032 Triangle read by rows: T(n,k) (n>=0, k>=n+1) is the number of integer partitions of n containing exactly k partitions. %C A264032 Row sums give A000041. %H A264032 FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000108">The number of partitions contained in the given partition</a>. %e A264032 Triangle begins: %e A264032 1, %e A264032 1, %e A264032 2, %e A264032 2,1, %e A264032 2,1,2, %e A264032 2,0,0,4,1, %e A264032 2,0,0,2,2,2,2,1, %e A264032 2,0,0,0,0,2,2,2,4,1,0,2, %e A264032 2,0,0,0,0,0,4,0,0,4,3,0,2,2,2,2,0,1, %e A264032 2,0,0,0,0,0,0,2,0,0,3,2,4,0,0,4,1,0,4,2,2,0,2,2, %e A264032 ... %Y A264032 Cf. A000041. %K A264032 nonn,tabf %O A264032 0,3 %A A264032 _Christian Stump_, Nov 01 2015