Javascript tips: 2 to the power of x multiplied by n
17 bytes:

puzzle=n=&gt;x=&gt;n&lt;&lt;x


This uses the fact that 2 * 2^n = 2^(n + 1). Also, by our rules, using currying instead of taking multiple arguments the usual way is allowed. Also, I don't think the let is needed.