OFFSET
2,3
COMMENTS
G is a simple graph of order n with exactly 2 components each of which is complete. T(n,k) is the total number of edges in G when one component contains exactly k vertices.
EXAMPLE
0,
1,
3, 2,
6, 4,
10, 7, 6,
15, 11, 9,
21, 16, 13, 12,
28, 22, 18, 16,
36, 29, 24, 21, 20
MATHEMATICA
Table[Table[Binomial[k, 2] + Binomial[n - k, 2], {k, 1, n/2}], {n, 2,
10}] // Grid
PROG
(Magma) [Binomial(k, 2)+Binomial(n-k, 2): k in [1..Floor(n/2)], n in [1..16]]; // Vincenzo Librandi, Oct 19 2014
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Geoffrey Critzer, Oct 18 2014
STATUS
approved