|
Search: id:A054548
|
|
|
| A054548 |
|
Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges. |
|
+0
3
|
|
| 0, 0, 1, 0, 0, 3, 1, 0, 0, 3, 16, 15, 6, 1, 0, 0, 0, 30, 135, 222, 205, 120, 45, 10, 1, 0, 0, 0, 15, 330, 1581, 3760, 5715, 6165, 4945, 2997, 1365, 455, 105, 15, 1, 0, 0, 0, 0, 315, 4410, 23604, 73755, 159390, 259105, 331716, 343161, 290745, 202755, 116175
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
FORMULA
|
a(n, k)=sum_{i=0..n} (-1)^(n-i)*C(n, i)*C(C(i, 2), k), k=0...n*(n-1)/2.
|
|
EXAMPLE
|
[0],[0,1],[0,0,3,1],[0,0,3,16,15,6,1],[0,0,0,30,135,222,205,120,45,10,1],...
|
|
CROSSREFS
|
Row sums give A006129. Cf. A054547.
Adjacent sequences: A054545 A054546 A054547 this_sequence A054549 A054550 A054551
Sequence in context: A035654 A085604 A122848 this_sequence A059202 A058865 A115090
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 09 2000
|
|
|
Search completed in 0.002 seconds
|
