I think the problem is quite computationally complex, owing to the fact that there are around a million billion billion billion billion different ways of splitting your 65 batteries into five groups of 13. It's not too difficult to set up a program that would split the batteries in every possible way, compute the average of each group, and then select the grouping with the smallest range. The problem is that the number of computations just grows stupidly fast, doubling every time you add one more battery. It takes my (admittedly not superfast) laptop about ten seconds to find all subsets of 13 elements in a list of 28, twice as long in a group of 29; memory's probably an issue as well (as it's still trying to finish the N=30 task, and gave up)... another 25 doublings on this computer appears to suggest that it would take me...45,000 years or so?
Hmm. Probably better to take a guess at a likely grouping, solve by hand, perform a couple of swaps, and give up when it's close enough.