2*binomial(n,3).
0, 0, 0, 2, 8, 20, 40, 70, 112, 168, 240, 330, 440, 572, 728, 910, 1120, 1360, 1632
2 seqfan posts
Tue Jan 5 19:43:34 CET 2010 [seqfan] Re: A graph counting problem
Sat Jan 2 16:36:01 CET 2010 [seqfan] Re: A graph counting problem
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.