Impossible darts scores I was surprised to not find this asked already, though there is a great question on darts checkouts: Darts meets Codegolf

Your challenge is to calculate which scores are not possible with 'n' darts below the maximum score for 'n' darts. E.g. for n=3, the maximum possible score is 180 so you would return [163,166,169,172,173,175,176,178,179]

For a bare bones rule summary:

Possible scores for a single dart are:


0 (miss)
1-20, 25, 50
double or triple of 1-20


Rules:


standard code golf rules apply
you must take a single parameter 'n' in whatever way your language allows and return a list/array of all unique scores below the maximum score which cannot be scored with n darts. You may also print these values to the console.
order of results is unimportant
shortest code in bytes wins
Python 3, 80 79 59 57 bytes

-1 byte thanks to Arnauld
-20 bytes thanks to ArBo
-2 bytes thanks to negative seven


lambda x:[-i-~x*60for i in(x&lt;2)*b'a[YUSOLI'+b'MJGDCA@&gt;=']


Try it online!