Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064447
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064447 EulerPhi[n^n]. +0
1
1, 2, 18, 128, 2500, 15552, 705894, 8388608, 258280326, 4000000000, 259374246010, 2972033482752, 279577021469772, 4762288639524864, 233543408203125000, 9223372036854775808, 778579070010669895696 (list; graph; listen)
OFFSET

1,2

LINKS

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

FORMULA

a(n)=A000005[A000312(n)]

EXAMPLE

If n=p, then a(n)=[p^(p-1)]*(p-1)=((Phi[n]+1)^Phi[n])*Phi[n]

MATHEMATICA

a[n_]:=EulerPhi[n^n]; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 2*4!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 03 2008]

PROGRAM

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

CROSSREFS

A000005, A000312.

Sequence in context: A052610 A052653 A060589 this_sequence A043022 A057971 A073512

Adjacent sequences: A064444 A064445 A064446 this_sequence A064448 A064449 A064450

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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research