odd-com-sieve-ulam-conrner.groovy

for(double N = 9; N < 199999; N+=2) {
  def U = Math.sqrt((N + Math.sqrt(N - 4)) / 4);
  def L = Math.floor(U - 1)
  def signature = []
  def isOddComNum
  double i = 0
  for(; i <= L && !isOddComNum; i++) {
    def B = (i * 4) + 6;
    def Q = (N / B) % 0.5;
    isOddComNum = Q == 0
    signature << (isOddComNum ? '|' : '.')
  }
  def index = N.toString().padRight(8)
  def tree = signature.join()
  if(isOddComNum) {
    println "${index} -> ${tree} ${isOddComNum ? '' : 'P'}"
  }
}