reviewed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
reviewed
approved
proposed
reviewed
editing
proposed
Amiram Eldar, <a href="/A069579/b069579.txt">Table of n, a(n) for n = 1..10000</a>
Numbers k such that phi(core(nk)) = core(phi(nk)) where core(xk) is the squarefree part of x; k (the smallest integer such that xk*core(xk) is a square).
core[n_] := Times @@ (First[#]^Mod[Last[#], 2]& /@ FactorInteger[n]); Select[Range[300], core[EulerPhi[#]] == EulerPhi[core[#]] &] (* Amiram Eldar, Sep 03 2020 *)
approved
editing
_Benoit Cloitre (benoit7848c(AT)orange.fr), _, Apr 18 2002
phi(core(n))=core(phi(n)) where core(x) is the square-free squarefree part of x; the smallest integer such that x*core(x) is a square.
easy,nonn,new
easy,nonn,new
Benoit Cloitre (abmtbenoit7848c(AT)wanadooorange.fr), Apr 18 2002
easy,nonn,new
Benoit Cloitre (abcloitreabmt(AT)modulonetwanadoo.fr), Apr 18 2002
easy,nonn,new
Benoit Cloitre (abcloitre(AT)wanadoomodulonet.fr), Apr 18 2002