login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A328856 A053150 A295657 * A006466 A316439 A335078
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Jul 25 2009
EXTENSIONS
More terms added by G. C. Greubel, Dec 20 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)