Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064448
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064448 GCD[n^n,EulerPhi[n^n]]. +0
1
1, 2, 9, 128, 625, 15552, 117649, 8388608, 129140163, 2000000000, 25937424601, 2972033482752, 23298085122481, 1587429546508288, 29192926025390625, 9223372036854775808, 48661191875666868481, 13115469358432179191808 (list; graph; listen)
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))]

PROGRAM

(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: A090242 A047684 A162955 this_sequence A110817 A110860 A050995

Adjacent sequences: A064445 A064446 A064447 this_sequence A064449 A064450 A064451

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research