%N Number of triangles in minimal triangle graphs.
%C a(n) is the total number of triples in all the minimal triangle graphs on n points. That is, a(n) = Sum |T| for all A000080(n) triangle graphs G(T) on n points.
%H R. Bowen, <a href="http://dx.doi.org/10.1090/S0025-5718-1967-0223276-1">The generation of minimal triangle graphs</a>, Math. Comp. 21 (1967), 248-250.
%e For n=3 points there is one minimal triangle graph containing one triple, so a(3) = 1.
%e For n=4 points there is one triangle graph containing two triples, so a(4) = 2.
%e For n=5 points there are two graphs, containing two and three triples, respectively, so a(5) = 2+3 = 5.
%e See also the illustration in A000080.
%Y Cf. A000080.
%A Arlin Anderson (starship1(AT)gmail.com)
%E Edited by _N. J. A. Sloane_, Jan 22 2014
%E a(17)-a(25) from _Martin Fuller_, Mar 23 2015