There is considerable literature on this question, and closely related variations.
See: 

 - The [*Thompson problem*](https://en.wikipedia.org/wiki/Thomson_problem): Which configurations of $n$ electrons on a sphere minimize the electrostatic potential energy?
 - The [*Tammes problem*](https://en.wikipedia.org/wiki/Tammes_problem): Which configurations of $n$ points on a sphere maximizes the smallest distance between any two points? Sometimes phrased as packing $n$ congruent circles on a sphere:

<hr />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 
![DiskPacking][1]
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 
<sup>
(Image from [Paul Sutcliffe](http://www.maths.dur.ac.uk/~dma0pms/my-projects/proj4_1213.html).)
</sup>
<hr />
According to

> Musin, Oleg R., and Alexey S. Tarasov. "The Tammes problem for $N=14$." [arXiv:1410.2536 Abstract](http://arxiv.org/abs/1410.2536) (2014).

the Tammes problem is solved exactly for

 - For $n=3,4,6,12$ by L. Fejes Toth (1943). 
 - For $n=5,7,8,9$ by Sch&uuml;tte and van der Waerden (1951).
 - For $n=10,11$ by Danzer (1963).
 - For $n=24$ by Robinson (1961).
 - For $n=13, 14$ by Musin and Tarasov (2014).
<hr />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 
[![N=14.][2]][2]
<br />
&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 
<sup>
Fig.1 from Musin and Tarasov: $n=14$.
</sup>
<hr />


  [1]: https://i.sstatic.net/fxBXg.jpg
  [2]: https://i.sstatic.net/bHCTF.png