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 A284911 #12 Apr 14 2017 23:59:39 %S A284911 1,1,1,4,5,21,84,330,1287,11440,92378,537472,4694482 %N A284911 Number of partitions of n^2 that are the sum of n not necessarily distinct partitions of n into distinct parts. %F A284911 a(n) <= binomial(A000009(n)+n-1,n) with equality only for n < 11. %e A284911 a(5) = 21: 55555, 555532, 555541, 5553322, 5554321, 5554411, 55333222, 55433221, 55443211, 55444111, 533332222, 543332221, 544332211, 544432111, 544441111, 3333322222, 4333322221, 4433322211, 4443322111, 4444321111, 4444411111. %Y A284911 Cf. A000009, A002054, A007318, A284645. %K A284911 nonn,more %O A284911 0,4 %A A284911 _Alois P. Heinz_, Apr 05 2017