Problem statement: You are given a number N, please find an array of length N so that, no two elements divide each other, and the total sum is minimized.

Example: N = 2: arr = {1} N = 3: arr = {2, 3}

Caveat: it isn't the first N primes.