OFFSET
1,2
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
EXAMPLE
Known Fermat primes 3 and 5 are terms because their phi value is divisible only by 2. Several composites are also here, such as {50, 999, 1000} with prime factors (2,5), (3,37) and (2,5); their phi values, {20, 648, 400}, also have 2 prime factors: (2,5), (2,3), (2,5).
MATHEMATICA
Select[Range[200], PrimeNu[#]==PrimeNu[EulerPhi[#]]&] (* Harvey P. Dale, Sep 12 2014 *)
PROG
(Haskell)
a055742 n = a055742_list !! (n-1)
a055742_list = [x | x <- [1..], a001221 x == a001221 (a000010 x)]
-- Reinhard Zumkeller, Apr 14 2015
(PARI) is(n)=my(f=factor(n)); #f~ == omega(eulerphi(f)) \\ Charles R Greathouse IV, Mar 01 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 11 2000
EXTENSIONS
Definition clarified by Harvey P. Dale, Sep 12 2014
STATUS
approved