OFFSET
1,2
COMMENTS
Also numbers k >= 1 such that the mean square of the Euler set of k is an integer.
Also numbers k >= 1 such that Sum_{i=1..k, gcd(k,i) = 1} i^2 is a multiple of phi(k), where phi is Euler's totient function.
MATHEMATICA
f[p_, e_] := -p^(1 - e); q[1] = True; q[n_] := IntegerQ[n * Times @@ f @@@ FactorInteger[n]/6 + n^2/3]; Select[Range[160], q] (* Amiram Eldar, Feb 25 2022, based on Brown's formula at A053818 *)
PROG
(PARI) isok(m) = denominator(sum(k=1, m, k^2*(gcd(m, k) == 1))/eulerphi(m)) == 1; \\ Michel Marcus, Feb 25 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
Ctibor O. Zizka, Feb 25 2022
STATUS
approved