I think a table with the following numeric values would be very interesting, but I have not found any table online displaying them:
Choose any NP-complete problem (say, click, but a problem with well-defined instances of $ n $– bit size for each $ n $ is probably the best for this question). For each value of $ n $ (input size), there is a boolean circuit of minimum size which solves the problem for instances of size $ n $. Obviously it is difficult to calculate these minimum sizes, but they can be calculated by an exhaustive search for small values of $ n $.
Is there an array of these values for the little ones $ n $ known?