The general rule-of-thumb is: expected maximum number of items in the hash table divided by 10 (to the next highest integer).
If you expect 100 max items, then 100 / 10 = 10 = N.
If you expect 1000 max items, then 1000 / 10 = 100 = N.
If you expect 255 max items, then 251 / 10 = 25.1 rounded up = 26 = N.