reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
numd[n_, k_] := Module[{p=FactorInteger[k][[;; , 1]], c=0}, Do[If[Divisible[n+k, n+p[[i]]], c++], {i, 1, Length[p]}]; c]; a[n_]:=Module[{k=1}, While[numd[n, k] <= 4, k++]; k]; Array[a, 30] (* Amiram Eldar, Sep 09 2019 *)
Amiram Eldar, <a href="/A202160/b202160.txt">Table of n, a(n) for n = 1..125</a>
approved
editing
proposed
approved
editing
proposed
The sequence of numbers k composite and squarefree, prime p | k ==> p+n | k+n is given by A029591 (least quasi-Carmichael number of order -n).
proposed
editing
editing
proposed
The sequence a(n) = of numbers k composite and squarefree, prime p | k ==> p+n | k+n is given by A029591 (least quasi-Carmichael number of order -n).
In this sequence, the majority of numbers terms are not squarefree.
a(3) = 460317 because the primes prime divisors of 460317 are 3, 11, 13, 29, 37 =>
approved
editing