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!)
A064449 a(n) = gcd(Phi(n!), Phi(n^n), Phi(lcm(1..n))). 1
1, 1, 2, 4, 4, 16, 6, 64, 18, 64, 10, 1152, 12, 1536, 1080, 1024, 16, 442368, 18, 163840, 972, 163840, 22, 15925248, 100, 196608, 1458, 196608, 28, 4777574400, 30, 1048576, 481140, 1048576, 21000, 2293235712, 36, 37748736, 157464, 524288000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = gcd(A000010(A000142(n)), A000010(A000312(n)), A000010(A003418(n))).
EXAMPLE
n=6: a(6) = gcd(Phi(720), Phi(46656), Phi(60)) = gcd(192, 16, 15552) = 16.
PROG
(PARI) { L=1; for (n=1, 300, L=lcm(L, n); write("b064449.txt", n, " ", gcd(eulerphi(n!), gcd(eulerphi(n^n), eulerphi(L)))) ) } \\ Harry J. Smith, Sep 14 2009
CROSSREFS
Sequence in context: A077815 A218075 A366709 * A117291 A246047 A079102
KEYWORD
nonn
AUTHOR
Labos Elemer, Oct 02 2001
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 17:51 EDT 2024. Contains 371797 sequences. (Running on oeis4.)