A002997 = Cases[Range[1, 100000, 2], n_ /; Mod[n, CarmichaelLambda[n]] == 1 && ! PrimeQ[n]]; carmichaelQ[n_] := Not[PrimeQ[n]] && Divisible[n - 1, CarmichaelLambda[n]]; numSol[n_] := Module[{m = 0}, ds = Divisors[n]; Do[d = ds[[k]]; If[! carmichaelQ[d], Continue[]]; m++, {k, 2, Length[ds] - 1}]; m]; numSolmax = -1; seq = {}; Do[n =
A002997[[j]]; m = numSol[n]; If[m > numSolmax, AppendTo[seq, n]; numSolmax = m], {j, 1, Length[
A002997]}]; seq