login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064449 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; internal format)
OFFSET

1,3

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,300

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)))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 14 2009]

CROSSREFS

A000010, A000142, A000312, A003418.

Sequence in context: A193848 A145891 A077815 * A117291 A079102 A071337

Adjacent sequences:  A064446 A064447 A064448 * A064450 A064451 A064452

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 02 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 02:51 EST 2012. Contains 205860 sequences.