cp's OEIS Frontend

Magma

function IsClardynum(X, i)
  if i eq 1 then
    return true;
  else
    xornum:=2^i - 2;
    xorcouple:=BitwiseXor(X, xornum);
    if (IsPrime(xorcouple)) then
       return false;
    else
       return IsClardynum(X, i-1);
    end if;
  end if;
end function;
for n:= 3 to 1052503 by 2 do
  if (IsOne(2^(n-1) mod n)
      and not IsPrime(n)
      and not n mod CarmichaelLambda(n) eq 1
      and IsClardynum(n,Ilog2(n)))
      then n;
  end if;
end for;