OFFSET
2,1
LINKS
Odimar Fabeny, Table of n, a(n) for n = 2..10000
MAPLE
count:= 0:
for n from 1 while count < 100 do
m:= 1+18*n;
if not isprime(m) then
count:= count+1;
A[count]:= min(numtheory:-factorset(m))
fi
od:
seq(A[i], i=1..count); # Robert Israel, Sep 30 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Odimar Fabeny, Sep 25 2014
STATUS
approved