n =

22

Styling sufficient conditions:

For every list below, one of the numbers must be a speed (if 0 is never lonely). That means: if there is no vertex cover of size n, the lonely runner conjecture holds for n.

something stopped working maybe

and then (or click two nodes to swap). Exclude these numbers (so triples can become pairs):3-cycles:

5-cycles: