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 A348198 #6 Oct 07 2021 02:15:38
%S A348198 1,3,9,15,45,105,225,405,495,1155,3675,4455,8085,19635,62475,75735,
%T A348198 137445,373065,1187025,1741905,2611455,8580495,27301575,50515245,
%U A348198 60063465,248834355,1021078905,2374216515,2822982855,11695214685,47990708535
%N A348198 Terms of A326835 having more divisors than any smaller term.
%C A348198 All the terms are odd since all the terms of A326835 are odd (as phi(1) = phi(2) = 1).
%C A348198 The corresponding numbers of divisors are 1, 2, 3, 4, 6, 8, 9, 10, 12, 16, 18, 20, 24, 32, 36, 40, 48, 64, 72, 80, 96, 128, 144, 160, 192, 256, 288, 320, 384, 512, 576, ...
%e A348198 The sequence A326835 begins with 1, 3, 5, 7, 9, 11, 13 and 15. The number of divisors of these terms are 1, 2, 2, 2, 3, 2, 2 and 4, respectively. The record values, 1, 2, 3 and 4, occur at 1, 3, 9 and 15, the first 4 terms of this sequence.
%t A348198 q[n_] := Length @ Union[EulerPhi /@ (d = Divisors[n])] == Length[d]; dm = 0; s = {}; Do[If[q[n], d = DivisorSigma[0, n]; If[d > dm, dm = d; AppendTo[s, n]]], {n, 1, 10^6, 2}]; s
%Y A348198 Cf. A326835, A328858, A348199.
%K A348198 nonn,more
%O A348198 1,2
%A A348198 _Amiram Eldar_, Oct 06 2021