with(numtheory); CM:=[]: for z from 1 to 1 do for m from 1 to 2000000 do n:=2*m+1; if not(isprime(n)) and issqrfree(n) then PF:=factorset(n); cmb:=true; for x in PF do if (n-1) mod (x-1) > 0 then cmb:=false fi od; if cmb then CM:=[op(CM), n]; fi; fi; #not od; #m od; #z select(proc(z) not(z mod 12 = 1) end, CM);