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 A327535 #5 Sep 18 2019 04:57:59
%S A327535 1,2,3,4,5,6,7,8,3,10,11,12,13,14,15,16,17,18,19,20,7,22,23,24,5,26,3,
%T A327535 28,29,30,31,32,33,34,35,36,37,38,13,40,41,42,43,44,45,46,47,48,7,50,
%U A327535 51,52,53,54,55,56,19,58,59,60,61,62,7,64,13,66,67,68,69
%N A327535 Maximum divisor of n that is 1, prime, or whose prime indices are relatively prime.
%C A327535 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 number of divisors of n satisfying the same conditions is A327536(n).
%H A327535 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 A327535 If n is in A327534, then a(n) = n; otherwise a(n) = A006530(n).
%e A327535 The divisors of 63 that are 1, prime, or whose prime indices are relatively prime are {1, 3, 7}, so a(63) = 7.
%t A327535 Table[Max@@Select[Divisors[n],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&],{n,100}]
%Y A327535 See link for additional cross-references.
%Y A327535 Cf. A000005, A000961, A006530, A056239, A112798, A281116, A289509, A327407.
%K A327535 nonn
%O A327535 1,2
%A A327535 _Gus Wiseman_, Sep 17 2019