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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074701 Numbers n such that n = sum( d dividing phi(n), mu(phi(d))*phi(n)/d ). 2

%I

%S 1,3,5,25,125,625,3125,15625,78125,390625,1953125,9765625,48828125,

%T 244140625,1220703125,6103515625,30517578125,152587890625,

%U 762939453125,3814697265625,19073486328125,95367431640625,476837158203125,2384185791015625,11920928955078125,59604644775390625,298023223876953125

%N Numbers n such that n = sum( d dividing phi(n), mu(phi(d))*phi(n)/d ).

%C Does sequence consist of 1,3 and all powers of 5? Answer from Lambert Klasen, Oct 07 2005: Yes! See attached file.

%H Lambert Klasen, <a href="/A074701/a074701.txt">Notes on A074701</a>

%p with(numtheory): a:=proc(n) local div: div:=convert(divisors(phi(n)),list): if add(mobius(phi(div[j]))*phi(n)/div[j],j=1..nops(div))=n then n else fi end: seq(a(n),n=1..5000); # _Emeric Deutsch_, Mar 27 2005

%o (PARI) isok(n) = n == sumdiv(eulerphi(n), d, moebius(eulerphi(d))*eulerphi(n)/d); \\ _Michel Marcus_, Aug 15 2019

%Y Cf. A000351. [_R. J. Mathar_, Sep 23 2008]

%K nonn

%O 1,2

%A _Benoit Cloitre_, Sep 03 2002

%E 2 more terms from _Emeric Deutsch_, Mar 27 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 00:07 EST 2019. Contains 329348 sequences. (Running on oeis4.)