List Sophie Germain primes
Pyth, 19 bytes * 2 - 10 = 28

Note that the online compiler/executor doesn't show output because it's an infinite loop.

K1#~K1I&amp;!tPK!tPhyKK


Explained:

K1                      K=1
  #                     While true:
   ~K1                  K+=1
      I                 If
       &amp;                logical AND
        !tPK            K is prime
            !tPhyK      2*K+1 is prime (y is double, h is +1)
                  K     Print K