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 A364055 #9 Jul 07 2023 23:08:56
%S A364055 1,1,0,0,2,0,0,0,0,7,0,0,0,0,0,0,34,0,0,0,0,0,0,0,0,192,0,0,0,0,0,0,0,
%T A364055 0,0,0,1206,0,0,0,0,0,0,0,0,0,0,0,0,8033,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A364055 55974,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A364055 Number of integer partitions of n satisfying (length) = (mean). Partitions of n into sqrt(n) parts.
%F A364055 a(n^2) = A206240(n).
%e A364055 The a(0) = 1 through a(9) = 7 partitions:
%e A364055 () (1) . . (22) . . . . (333)
%e A364055 (31) (432)
%e A364055 (441)
%e A364055 (522)
%e A364055 (531)
%e A364055 (621)
%e A364055 (711)
%t A364055 Table[Length[If[n==0,{{}},Select[IntegerPartitions[n],Mean[#]==Length[#]&]]],{n,0,30}]
%Y A364055 The strict case is A107379(sqrt(n)).
%Y A364055 Without zeros we have A206240.
%Y A364055 These partitions have ranks A363951.
%Y A364055 A008284 counts partitions by length, A058398 by mean.
%Y A364055 A067538 counts partitions with integer mean, ranks A316413.
%Y A364055 Cf. A025065, A026905, A237984, A327472, A327482, A363944, A363949.
%K A364055 nonn
%O A364055 0,5
%A A364055 _Gus Wiseman_, Jul 07 2023