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 A305551 #13 Sep 07 2018 12:04:09
%S A305551 1,1,3,4,9,8,22,16,43,41,77,57,201,102,264,282,564,298,1175,491,1878,
%T A305551 1509,2611,1256,7872,2421,7602,8026,16304,4566,38434,6843,48308,41078,
%U A305551 56582,28228,221115,21638,146331,208142,453017,44584,844773,63262,1034193,1296708
%N A305551 Number of partitions of partitions of n where all partitions have the same sum.
%H A305551 Andrew Howroyd, <a href="/A305551/b305551.txt">Table of n, a(n) for n = 0..1000</a>
%F A305551 a(n) = Sum_{d|n} binomial(A000041(n/d) + d - 1, d).
%e A305551 The a(4) = 9 partitions of partitions where all partitions have the same sum:
%e A305551 (4), (31), (22), (211), (1111),
%e A305551 (2)(2), (2)(11), (11)(11),
%e A305551 (1)(1)(1)(1).
%t A305551 Table[Sum[Binomial[PartitionsP[n/k]+k-1,k],{k,Divisors[n]}],{n,60}]
%o A305551 (PARI) a(n)={if(n<1, n==0, sumdiv(n, d, binomial(numbpart(n/d) + d - 1, d)))} \\ _Andrew Howroyd_, Jun 22 2018
%Y A305551 Cf. A000005, A001970, A001315, A007716, A038041, A055887, A063834, A271619, A289078, A298422, A306017.
%K A305551 nonn
%O A305551 0,3
%A A305551 _Gus Wiseman_, Jun 20 2018