There are an equal number (n) of coins of each of the values: $1, $2, $3.

For each of the numbers n = 1 to 8
determine in how many ways it is possible to divide the set of coins in such a way that each brother gets the same number of coins and the same total value of coins.

Do not count permutations of the brothers separately. Just count the breakdowns.

Note 1: Please avoid the temptation to look this sequence up. It will give away a surprise.
Note 2: I would prefer you not do this with a computer program.