login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A218101
The number of simple labeled graphs on n nodes that have exactly n(n-1)/4 edges.
0
1, 0, 0, 20, 252, 0, 0, 40116600, 9075135300, 0, 0, 7219428434016265740, 27217014869199032015600, 0, 0, 96614908840363322603893139521372656, 5949105755928259715106809205795376486500, 0, 0, 90717484605833107953850163563674201296374152790550788800, 90492479540310008180848641429024900729436748166512078795479440, 0, 0
OFFSET
1,4
MATHEMATICA
f[n_]:=If[Mod[n, 4]==1||Mod[n, 4]==0, Binomial[n (n-1)/2, n (n-1)/4], 0]; Table[f[n], {n, 1, 25}]
CROSSREFS
Sequence in context: A055757 A022744 A081143 * A241228 A306290 A075469
KEYWORD
nonn
AUTHOR
Geoffrey Critzer, Oct 20 2012
STATUS
approved