1 paper
Jörgen Backelin
This first extracted report contains all lower and upper bounds for e-numbers e(3,k;n), for n≤43, that I know. All but 24 of them are known (exactly).Very little of the pr…