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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064448 GCD[n^n,EulerPhi[n^n]]. 1
1, 2, 9, 128, 625, 15552, 117649, 8388608, 129140163, 2000000000, 25937424601, 2972033482752, 23298085122481, 1587429546508288, 29192926025390625, 9223372036854775808, 48661191875666868481, 13115469358432179191808 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

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

FORMULA

a(n)=GCD[A000312(n), A000010(A000312(n))]

PROG

(PARI) { for (n=1, 100, p=n^n; write("b064448.txt", n, " ", gcd(p, eulerphi(p))) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 14 2009]

CROSSREFS

A000312, A000010.

Sequence in context: A047684 A162955 A197314 * A173215 A110817 A189428

Adjacent sequences:  A064445 A064446 A064447 * A064449 A064450 A064451

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 14 22:30 EST 2012. Contains 205678 sequences.