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 A355032 #13 Jun 22 2022 02:32:09
%S A355032 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%T A355032 1,2,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
%U A355032 1,1,1,3,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1
%N A355032 a(n) is the maximum number of prime signatures of numbers with n divisors that have the same number of prime divisors (counted with multiplicity).
%H A355032 Amiram Eldar, <a href="/A355032/b355032.txt">Table of n, a(n) for n = 1..10000</a>
%F A355032 a(A355033(n)) = n.
%e A355032 a(2) = 1 since the numbers with 2 divisors are all primes and thus have only 1 prime signature.
%e A355032 a(36) = 2 since numbers with 36 divisors have 2 prime signatures, p1^5 * p2^5 and p1 * p2 * p3^8, that correspond to numbers with 10 prime divisors (counted with multiplicity).
%e A355032 a(72) = 3 since numbers with 72 divisors have 3 prime signatures, p1 * p2^5 * p3^5, p1^2 * p2^2 * p3^7 and p1 * p2 * p3 * p4^8, that correspond to numbers with 11 prime divisors (counted with multiplicity).
%t A355032 Table[Max[Tally[Total[#-1]& /@ f[n]][[;;,2]]], {n, 1, 100}] (* using the function f by _T. D. Noe_ at A162247 *)
%Y A355032 Cf. A000005, A001222, A118914, A162247, A355028, A355030, A355031, A355033.
%K A355032 nonn
%O A355032 1,36
%A A355032 _Amiram Eldar_, Jun 16 2022