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 A284645 #23 Apr 06 2017 13:09:41 %S A284645 1,1,3,10,55,266,1974,11418,88671,613756,4884308 %N A284645 Number of partitions of n^2 that are the sum of n not necessarily distinct partitions of n. %F A284645 a(n) = A213086(n,n). %F A284645 a(n) <= binomial(A000041(n)+n-1,n) with equality only for n<4. %e A284645 a(0) = 1: the empty partition. %e A284645 a(1) = 1: 1. %e A284645 a(2) = 3: 22, 211, 1111. %e A284645 a(3) = 10: 333, 3321, 32211, 33111, 222111, 321111, 2211111, 3111111, 21111111, 111111111. (Two of the A206226(3) = 12 partitions are not counted here: 3222, 22221.) %Y A284645 Main diagonal of A213086. %Y A284645 Cf. A000041, A206226, A284911. %K A284645 nonn,more %O A284645 0,3 %A A284645 _Alois P. Heinz_, Apr 03 2017