Discovered with pfgw, development version 20050213, candidates were sieved to 2^44 (1.759e13) with Sr2sieve, checked by strong (Miller-Rabin) tests in all prime bases from 2 to 71 (20 tests in total).
This discovery eliminates a sequence 2^n+k from the dual Sierpinski problem, see: http://sierpinski.insider.com/dual

To be completed...