[go: up one dir, main page]

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