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 A364810 #18 Sep 17 2023 18:50:54
%S A364810 1,1,1,2,3,4,8,9,12,17,26,27,44,53,76,98,128,168,212,273,344,429,525,
%T A364810 662,796,981,1182,1442,1709,2096,2663,3406,4315,5426,6784,8417,10466,
%U A364810 12824,15721,19104,23267,27981,33856,40515,48508,57826,68982,81493,96869
%N A364810 a(n) = greatest number in row n of the array in A225485.
%C A364810 a(n) = the greatest number of partitions of n that all have the same frequency depth (as in A225485); this is also the greatest number of partitions of n that all have the same adjusted frequency depth (A325245).
%H A364810 Alois P. Heinz, <a href="/A364810/b364810.txt">Table of n, a(n) for n = 1..200</a>
%e A364810 Following the example in A225485, the frequency depths for the partitions of 8 are 1,2,3,4,5, and these occur 1,3,6,9,3 times, respectively. The greatest of these is 9, so that a(8) = 9.
%t A364810 c[s_] := c[s] = Select[Table[Count[s, i], {i, 1, Max[s]}], # > 0 &];
%t A364810 f[s_] := f[s] = Drop[FixedPointList[c, s], -2];
%t A364810 t[s_] := t[s] = Length[f[s]];
%t A364810 u[n_] := u[n] = Table[t[Part[IntegerPartitions[n], i]], {i, 1, Length[IntegerPartitions[n]]}];
%t A364810 v = Table[Count[u[n], k], {n, 2, 12}, {k, 1, Max[u[n]]}]
%t A364810 Map[Max, v]
%Y A364810 Cf. A000041, A225485, A225486, A325245.
%K A364810 nonn
%O A364810 1,4
%A A364810 _Clark Kimberling_, Sep 14 2023
%E A364810 a(36)-a(49) from _Alois P. Heinz_, Sep 15 2023