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 A327389 #7 Sep 16 2019 12:38:00
%S A327389 1,2,3,4,5,6,7,8,3,10,11,12,13,14,15,16,17,6,19,20,7,22,23,24,5,26,3,
%T A327389 28,29,30,31,32,33,34,35,12,37,38,13,40,41,14,43,44,15,46,47,48,7,10,
%U A327389 51,52,53,6,55,56,19,58,59,60,61,62,7,64,13,66,67,68,69
%N A327389 Maximum divisor of n that is prime or whose prime indices are pairwise coprime.
%C A327389 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.
%H A327389 Gus Wiseman, <a href="https://docs.google.com/document/d/e/2PACX-1vSX9dPMGJhxB8rOknCGvOs6PiyhupdWNpqLsnphdgU6MEVqFBnWugAXidDhwHeKqZe_YnUqYeGOXsOk/pub">Sequences counting and encoding certain classes of multisets</a>
%F A327389 If n is in A302569, then a(n) = n.
%t A327389 primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t A327389 Table[Max[Select[Divisors[n],UnsameQ@@Sort[Join@@Union/@primeMS/@primeMS[#]]&]],{n,100}]
%Y A327389 See link for additional cross-references.
%Y A327389 Cf. A000005, A000837, A006530, A056239, A112798, A327398.
%K A327389 nonn
%O A327389 1,2
%A A327389 _Gus Wiseman_, Sep 15 2019