|
Search: id:A058878
|
|
|
| A058878 |
|
Triangle T(n,k) = number of labeled graphs of even degree with n nodes and k edges (n >= 0, 0<=k<=n(n-1)/2). |
|
+0
1
|
|
| 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 4, 3, 0, 0, 1, 0, 0, 10, 15, 12, 15, 10, 0, 0, 1, 1, 0, 0, 20, 45, 72, 160, 240, 195, 120, 96, 60, 15, 0, 0, 0, 1, 0, 0, 35, 105, 252, 805, 1935, 3255, 4515, 5481, 5481, 4515, 3255, 1935, 805, 252, 105, 35, 0, 0, 1, 1, 0, 0, 56
(list; graph; listen)
|
|
|
OFFSET
|
0,14
|
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 13, (1.4.7).
|
|
EXAMPLE
|
1; 1,0; 1,0,0; 1,0,0,1; 1,0,0,4,3,0,0; ...
|
|
MAPLE
|
w := p->expand(simplify(2^(-p)*(1+x)^(p*(p-1)/2)*add(binomial(p, n)*( (1-x)/(1+x))^(n*(p-n)), n=0..p))); T := (n, k)->coeff(w(n), x, k);
|
|
CROSSREFS
|
Adjacent sequences: A058875 A058876 A058877 this_sequence A058879 A058880 A058881
Sequence in context: A057110 A073275 A030120 this_sequence A019983 A019984 A056969
|
|
KEYWORD
|
nonn,easy,nice,tabf
|
|
AUTHOR
|
njas, Jan 07 2001
|
|
|
Search completed in 0.002 seconds
|
