# Program generating 20000 terms of the conjectured sequence. fop := fopen("D:/SEQFAN/Maple/ppartable6.txt", WRITE, TEXT); ppgen := proc (n) local c, i, j, k, pless, nprimes, pp; pless := {}; for i from 3 to n do if isprime(i) then pless := `union`(pless, {i}); end if; end do; nprimes := numelems(pless); for k to nprimes do for j from 2 by 2 to pless[k]-3 do c := j*pless[k]+1; if isprime(c) then pp := c+pless[k]; if pp < 3*pless[-1] then fprintf(fop, "%d %d = %d * %d + 1 ", pp, c, j, pless[k]); else break; end if; end if; end do; end do; end proc; n := 134200; ppgen(n); fclose(fop);