1,2

(* first do *) Needs["NumberTheory`NumberTheoryFunctions`"] (* then *) PrimeFactors[n_] := Flatten[ Table[ # [[1]], {1} ] & /@ FactorInteger[ n ]]; f[n_] := Block[{k = n + 1}, If[EvenQ[k], k++ ]; While[ PrimeQ[k] || Union[ PowerMod[ PrimeFactors[n], k - 1, k]] != {1}, k += 2]; k]; a = {1}; b = {9}; Do[ If[ SquareFreeQ[n], c = f[n]; If[c > b[[ -1]], AppendTo[a, n]; AppendTo[b, c]; Print[n]]], {n, 2, 145000}]; a

Cf. A098650, A098652.

Sequence in context: A138621 A163061 A033286 this_sequence A087427 A141126 A056520

Adjacent sequences: A098648 A098649 A098650 this_sequence A098652 A098653 A098654

nonn

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 18 2004 17094