Gilbreath's Conjecture
Proof:
corollary of Bertrand's Theorem, given Euclid's hcf algorithm
will also work with some other sequences bounded by 2^n, e.g.
2,3,5,9,17,33,65,129,257,513,....
5,7,11,19,35,67,131,259,515,....