OFFSET
0,1
COMMENTS
It can easily be proved that a(n) == 3 (mod 4) for all n > 2.
LINKS
Amiram Eldar, Table of n, a(n) for n = 0..500
MATHEMATICA
a[0] = 2; a[n_] := a[n] = Module[{t = Array[a, n, 0], k = a[n - 1] + 1}, While[! SquareFreeQ[k] || AnyTrue[t, ! SquareFreeQ[k + #] &], k++]; k]; Array[a, 100, 0] (* Amiram Eldar, Aug 21 2023 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jul 09 2003
EXTENSIONS
More terms from Ray Chandler, Sep 13 2003
STATUS
approved