|
|
A091478
|
|
Table of graphs with n (>=0) nodes and k (>=0) edges. Each type of object labeled from its own label set.
|
|
2
|
|
|
1, 1, 1, 1, 1, 3, 6, 6, 1, 6, 30, 120, 360, 720, 720, 1, 10, 90, 720, 5040, 30240, 151200, 604800, 1814400, 3628800, 3628800, 1, 15, 210, 2730, 32760, 360360, 3603600, 32432400, 259459200, 1816214400, 10897286400, 54486432000, 217945728000, 653837184000, 1307674368000, 1307674368000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
REFERENCES
|
F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 114 (2.4.44).
|
|
LINKS
|
|
|
FORMULA
|
a(n, k) = k!*binomial(binomial(n, 2), k).
|
|
EXAMPLE
|
1;
1;
1, 1;
1, 3, 6, 6;
1, 6, 30, 120, 360, 720, 720;
...
|
|
CROSSREFS
|
Row lengths: A000124(n-1) for n>=1.
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|