|
|
A105261
|
|
Values of n such that phi(n)=c(n)^2, where phi is the Euler totient function and c(n) is the product of the distinct prime factors of n (c(1)=1).
(history;
published version)
|
|
|
#16 by Joerg Arndt at Wed Sep 23 04:39:48 EDT 2020
|
|
|
|
#15 by Michel Marcus at Wed Sep 23 04:38:40 EDT 2020
|
|
|
|
#14 by Michel Marcus at Wed Sep 23 04:38:26 EDT 2020
|
| LINKS
|
J.-M. De KonickKoninck, <a href="https://www.jstor.org/stable/4145084">When the Totient Is the Product of the Squared Prime Divisors: Problem 10966</a>, Amer. Math. Monthly, 111 (2004), p. 536.
|
| STATUS
|
approved
editing
|
|
|
|
#13 by Bruno Berselli at Wed Jun 05 09:14:23 EDT 2019
|
|
|
|
#12 by Michel Marcus at Wed Jun 05 08:54:23 EDT 2019
|
|
|
|
#11 by Michel Marcus at Wed Jun 05 08:54:18 EDT 2019
|
| REFERENCES
|
J.-M. De Konick, Problem 10966, Amer. Math. Monthly, 111 (2004), p. 536.
|
| LINKS
|
J.-M. De Konick, <a href="https://www.jstor.org/stable/4145084">When the Totient Is the Product of the Squared Prime Divisors: Problem 10966</a>, Amer. Math. Monthly, 111 (2004), p. 536.
|
| STATUS
|
approved
editing
|
|
|
|
#10 by Charles R Greathouse IV at Thu Nov 21 13:11:42 EST 2013
|
| MATHEMATICA
|
Select[Range[42000], EulerPhi[#] == Times @@ FactorInteger[#][[All, 1]]^2 & ] (* From & ] (* _Jean-François Alcover, _, Sep 12 2011 *)
|
|
|
Discussion
|
Thu Nov 21
| 13:11
| OEIS Server: https://oeis.org/edit/global/2066
|
|
|
|
#9 by Russ Cox at Fri Mar 30 17:36:01 EDT 2012
|
| AUTHOR
|
_Emeric Deutsch (deutsch(AT)duke.poly.edu), _, Apr 14 2005
|
|
|
Discussion
|
Fri Mar 30
| 17:36
| OEIS Server: https://oeis.org/edit/global/173
|
|
|
|
#8 by T. D. Noe at Mon Oct 03 16:07:53 EDT 2011
|
| MATHEMATICA
|
Select[Range[42000], EulerPhi[#] == Times @@ FactorInteger[#][[All, 1]]^2 & ] (* From Jean-François J.F. Alcover, Sep 12 2011 *)
|
|
|
Discussion
|
Mon Oct 03
| 16:07
| OEIS Server: https://oeis.org/edit/global/97
|
|
|
|
#7 by T. D. Noe at Mon Sep 12 15:51:36 EDT 2011
|
|
|
|