OFFSET
1,1
COMMENTS
Define C(k) to be the numbers n such that n is composite and squarefree and for p prime, p|n => p+k|n+k (p+k and n+k positive); sequence gives C(-3).
These are called 3-Korselt numbers by Bouallegue et al.
LINKS
Giovanni Resta, Table of n, a(n) for n = 1..2453 (terms < 10^12)
K. Bouallegue, O. Echi, R. G. E. Pinch, Korselt numbers and sets, Intl. J. Numb. Theory 6 (2) (2010) 257-269.
MATHEMATICA
qcm[n_, d_] := Block[{p, e}, {p, e} = Transpose@FactorInteger@n; Length[p] > 1 && Max[e] == 1 && ! MemberQ[p, d] && Max@ Mod[n-d, p-d] == 0]; Select[Range[10^5], qcm[#, 3] &] (* Giovanni Resta, May 21 2013 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved