login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A245047
Numbers n where phi(n)|n or tau(n)|n.
1
1, 2, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 40, 48, 54, 56, 60, 64, 72, 80, 84, 88, 96, 104, 108, 128, 132, 136, 144, 152, 156, 162, 180, 184, 192, 204, 216, 225, 228, 232, 240, 248, 252, 256, 276, 288, 296, 324, 328, 344, 348, 360, 372, 376, 384, 396, 424, 432, 441, 444, 448, 450
OFFSET
1,2
COMMENTS
Phi(n) is Euler totient function (A000010); tau(n) is the number of divisors of n (A000005).
Union of A007694 and A033950. - Michel Marcus, Jul 15 2014
LINKS
MAPLE
select(t -> (t mod numtheory:-phi(t) = 0) or (t mod numtheory:-tau(t) = 0), [$1..1000]); # Robert Israel, Jul 15 2014
MATHEMATICA
Select[Range[500], AnyTrue[{#/EulerPhi[#], #/DivisorSigma[0, #]}, IntegerQ]&] (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Oct 12 2020 *)
PROG
(PARI) isok(n) = !((n % eulerphi(n)) && (n % numdiv(n))); \\ Michel Marcus, Jul 15 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Muehlfeld, Jul 13 2014
STATUS
approved