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 A327536 #5 Sep 18 2019 04:58:07
%S A327536 1,2,2,3,2,4,2,4,2,4,2,6,2,4,4,5,2,5,2,6,3,4,2,8,2,4,2,6,2,8,2,6,4,4,
%T A327536 4,8,2,4,3,8,2,7,2,6,5,4,2,10,2,5,4,6,2,6,4,8,3,4,2,12,2,4,3,7,3,8,2,
%U A327536 6,4,8,2,11,2,4,5,6,4,7,2,10,2,4,2,11,4
%N A327536 Number of divisors of n that are 1, prime, or whose prime indices are relatively prime.
%C A327536 A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers that are 1, prime, or whose prime indices are relatively prime are A327534. The maximum divisor of n satisfying the same conditions is A327535(n).
%H A327536 Gus Wiseman, <a href="https://docs.google.com/document/d/e/2PACX-1vSX9dPMGJhxB8rOknCGvOs6PiyhupdWNpqLsnphdgU6MEVqFBnWugAXidDhwHeKqZe_YnUqYeGOXsOk/pub">Sequences counting and encoding certain classes of multisets</a>
%e A327536 The divisors of 63 that are 1, prime, or whose prime indices are relatively prime are {1, 3, 7}, so a(63) = 3.
%t A327536 Table[Length[Select[Divisors[n],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&]],{n,100}]
%Y A327536 See link for additional cross-references.
%Y A327536 Cf. A000005, A056239, A112798, A281116, A289509, A327407.
%K A327536 nonn
%O A327536 1,2
%A A327536 _Gus Wiseman_, Sep 17 2019