OFFSET
1,1
COMMENTS
On the other hand, no composite numbers are known such that p^2 * (p-1) divides (n-p) for every prime p dividing n.
MATHEMATICA
hh[n_] := Module[{aux = FactorInteger[n]}, Union@Table[IntegerQ[2 (n - aux[[i, 1]])/(aux[[i, 1]]^2 * (aux[[i, 1]] - 1))], {i, 1, Length[aux]}] == {True}]; Select[1+Range[50000], !PrimeQ[#] && hh[#] &]
PROG
(PARI) p=3; forprime(q=5, 1e7, for(n=p+1, q-1, f=factor(n)[, 1]; for(i=1, #f, if(2*(n-f[i])%(f[i]^2*(f[i]-1)), next(2))); print1(n", ")); p=q) \\ Charles R Greathouse IV, Dec 21 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
José María Grau Ribas, Dec 20 2011
STATUS
approved