OFFSET
3,2
COMMENTS
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.
LINKS
R. Bowen, The generation of minimal triangle graphs, Math. Comp. 21 (1967), 248-250.
EXAMPLE
For n=3 points there is one minimal triangle graph containing one triple, so a(3) = 1.
For n=4 points there is one triangle graph containing two triples, so a(4) = 2.
For n=5 points there are two graphs, containing two and three triples, respectively, so a(5) = 2+3 = 5.
See also the illustration in A000080.
CROSSREFS
KEYWORD
nonn,more,nice
AUTHOR
Arlin Anderson (starship1(AT)gmail.com)
EXTENSIONS
Edited by N. J. A. Sloane, Jan 22 2014
a(17)-a(25) from Martin Fuller, Mar 23 2015
STATUS
approved