n= 1: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..1
n= 2: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..2
n= 3: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..3
n= 4: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..3
n= 5: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..4
n= 6: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..5
n= 7: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..5
n= 8: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..6
n= 9: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..7
n=10: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..7
n=11: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..8
n=12: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..9
n=13: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..9
n=14: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..10
n=15: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..11
n=16: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..11
n=17: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..12
n=18: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..13
n=19: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..13
n=20: (Z) at most two missing, two attained: True; (P) parity-class bound: True; (Q) sum of m smallest >= floor((m-1)^2/4) for all m: True; equality for m in 1..14
