The most naive way of computing n¹⁵ requires fourteen multiplications:

n n ... n = n¹⁵

But using a "binary" method you can compute it in six multiplications:

n n = n²
n²n² = n⁴
n⁴n⁴ = n⁸
n⁸n⁴ = n¹²
n¹²n² = n¹⁴
n¹⁴n = n¹⁵

However it is yet possible to compute it in only five multiplications:

n n = n²
n²n = n³
n³n³ = n⁶
n⁶n⁶ = n¹²
n¹²n³ = n¹⁵

We shall define m(k) to be the minimum number of multiplications to compute n^k; for example m(15) = 5.

For 1 k 200, find m(k).