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”).

A163379
a(n) = phi(phi(tau(n))).
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2
OFFSET
1,16
LINKS
FORMULA
MATHEMATICA
EulerPhi[EulerPhi[DivisorSigma[0, Range[100]]]] (* G. C. Greubel, Dec 20 2016 *)
PROG
(PARI) vector(100, n, eulerphi(eulerphi(numdiv(n)))) \\ G. C. Greubel, Dec 20 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Jul 25 2009
EXTENSIONS
More terms added by G. C. Greubel, Dec 20 2016
STATUS
approved