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 A325252 #5 Apr 23 2019 09:20:40
%S A325252 1,1,1,1,2,1,3,1,3,8,11,11,19,17,25,29,83,113,124,171,190,242,289,368,
%T A325252 399,796,981,1182,1442,1709,2096,2469,2990,3545,4276,5037,8417,10466,
%U A325252 12824,15721,19104,23267,27981,33856,40515,48508,57826,68982,81493,446,738
%N A325252 Number of integer partitions of n with frequency depth floor(sqrt(n)).
%C A325252 The adjusted frequency depth of an integer partition is 0 if the partition is empty, and otherwise it is 1 plus the number of times one must take the multiset of multiplicities to reach a singleton. For example, the partition (32211) has adjusted frequency depth 5 because we have: (32211) -> (221) -> (21) -> (11) -> (2).
%e A325252 The a(2) = 1 through a(12) = 19 partitions (A = 10, B = 11):
%e A325252 2 3 22 11111 33 1111111 44 54 64 65 75
%e A325252 1111 222 2222 63 73 74 84
%e A325252 111111 11111111 72 82 83 93
%e A325252 81 91 92 A2
%e A325252 432 532 A1 B1
%e A325252 531 541 542 543
%e A325252 621 631 632 642
%e A325252 222111 721 641 651
%e A325252 3322 731 732
%e A325252 4321 821 741
%e A325252 4411 5321 831
%e A325252 921
%e A325252 4422
%e A325252 5421
%e A325252 5511
%e A325252 6321
%e A325252 332211
%e A325252 333111
%e A325252 22221111
%t A325252 fdadj[ptn_List]:=If[ptn=={},0,Length[NestWhileList[Sort[Length/@Split[#1]]&,ptn,Length[#1]>1&]]];
%t A325252 Table[Length[Select[IntegerPartitions[n],fdadj[#]==Floor[Sqrt[n]]&]],{n,0,30}]
%Y A325252 Cf. A117571, A181819, A225485, A323014, A323023, A325245, A325246, A325253, A325258, A325271, A325278, A325280, A325282.
%K A325252 nonn
%O A325252 0,5
%A A325252 _Gus Wiseman_, Apr 22 2019