# Binary prime numbers: grammar

I want to write a grammar which produces binary prime numbers. But I can't find any patterns this grammar can be made of. Like this:

1. In binary all prime numbers except 2 begin and end with 1


If I had a whole set of such rules, it wouldn't be hard to write a grammar. Any information will be valuable for me!