%I #9 Oct 06 2020 08:56:22
%S 0,1,2,4,5,6,7,12,9,13,11,18
%N Number of edges in a minimum gossip graph on n nodes.
%H Guillaume Fertin, <a href="https://doi.org/10.1016/S0012-365X(99)00227-7">A study of minimum gossip graphs</a>, Discrete Mathematics 215.1-3 (2000): 33-57.
%K nonn,more
%O 1,3
%A _N. J. A. Sloane_, Jul 26 2018