OFFSET
1,1
COMMENTS
All the terms are nonsquarefree numbers since A392814(k) = 0 for a squarefree number k.
Numbers whose prime factorization includes at least one prime power, p^e, such that p mod e > 0 (i.e., 1 < e != p).
The asymptotic density of this sequence is 1 - Product_{p prime} (1 - 1/p^2 + 1/p^p - 1/p^(p+1)) = 1 - (1/zeta(2)) * Product_{p prime} (1 + 1/((p+1)*p^(p-1))) = 0.27085521196763521798... .
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
MATHEMATICA
f[p_, e_] := Mod[p, e]; q[1] = False; q[k_] := Plus @@ f @@@ FactorInteger[k] > 0; Select[Range[240], q]
PROG
(PARI) isok(k) = {my(f = factor(k)); sum(i = 1, #f~, f[i, 1] % f[i, 2]) > 0; }
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Amiram Eldar, Jan 24 2026
STATUS
approved
