2,1

Odimar Fabeny, Table of n, a(n) for n = 2..10000

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

Cf. A056608, A247681.

Sequence in context: A144567 A215732 A010718 * A306400 A090987 A278813

Adjacent sequences: A247869 A247870 A247871 * A247873 A247874 A247875

nonn,easy

Odimar Fabeny, Sep 25 2014

approved