// This program generates prime quadruplets, that is, numbers n // such that n, n+2, n+6, n+8 are all prime. // // See: // http://oeis.org/A007530 n = 2 while (n <= 1 billion) { if isPrime[n+2] and isPrime[n+6] and isPrime[n+8] println[n] n = nextPrime[n] }