This provers' code is  effectively  the converse of
p136. Previously,
OpenPFGW was taken as the standard and older versions of
LLR were tested thereby. Now we take LLR as the standard,
for the Rieselform k*2^n1, and are happy to report that
resultant tests of OpenPFGW are also successful.
137*2^n1 is prime for
n = 2, 18, 38, 62, 2180, 2900, 3132, 3462, 3578, 5724,
5810, 18468, 30044, 36122, 37610, 43782, 310790, 1849238
...
137137*2^n1 is prime for
n = 9, 25, 41, 61, 201, 845, 5197, 6229, 8285, 11313,
15721, 69065, 93797, 96201, 206189, 687797, 725437,
978229, 1993201 ...
