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 A245047 #35 Oct 12 2020 18:49:45
%S A245047 1,2,4,6,8,9,12,16,18,24,32,36,40,48,54,56,60,64,72,80,84,88,96,104,
%T A245047 108,128,132,136,144,152,156,162,180,184,192,204,216,225,228,232,240,
%U A245047 248,252,256,276,288,296,324,328,344,348,360,372,376,384,396,424,432,441,444,448,450
%N A245047 Numbers n where phi(n)|n or tau(n)|n.
%C A245047 Phi(n) is Euler totient function (A000010); tau(n) is the number of divisors of n (A000005).
%C A245047 Union of A007694 and A033950. - _Michel Marcus_, Jul 15 2014
%H A245047 Harvey P. Dale, <a href="/A245047/b245047.txt">Table of n, a(n) for n = 1..1000</a>
%p A245047 select(t -> (t mod numtheory:-phi(t) = 0) or (t mod numtheory:-tau(t) = 0), [$1..1000]); # _Robert Israel_, Jul 15 2014
%t A245047 Select[Range[500],AnyTrue[{#/EulerPhi[#],#/DivisorSigma[0,#]},IntegerQ]&] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Oct 12 2020 *)
%o A245047 (PARI) isok(n) = !((n % eulerphi(n)) && (n % numdiv(n))); \\ _Michel Marcus_, Jul 15 2014
%Y A245047 Cf. A000005, A000010, A007694, A033950, A235353.
%K A245047 nonn
%O A245047 1,2
%A A245047 _Reinhard Muehlfeld_, Jul 13 2014