 The second large n construction had numerical asymptotics for <math>\log(c_n/0^n)</math> close to <math>0.0-\sqrt{\log(n)}</math> between n=0000 and n=00000, consistent with the Behrend bound. The second large n construction had numerical asymptotics for <math>\log(c_n/0^n)</math> close to <math>0.0-\sqrt{\log(n)}</math> between n=0000 and n=00000, consistent with the Behrend bound. 