|
|
A091480
|
|
Table of multigraphs (by antidiagonals) with n (>=1) nodes and k (>=0) edges. Each type of object labeled from its own label set.
|
|
0
|
|
|
1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 9, 6, 1, 0, 1, 27, 36, 10, 1, 0, 1, 81, 216, 100, 15, 1, 0, 1, 243, 1296, 1000, 225, 21, 1, 0, 1, 729, 7776, 10000, 3375, 441, 28, 1, 0, 1, 2187, 46656, 100000, 50625, 9261, 784, 36, 1, 0, 1, 6561, 279936, 1000000, 759375
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
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) = binomial(n, 2)^k.
|
|
EXAMPLE
|
1 0 0 0 0 ...
1 1 1 1 1 ...
1 3 9 27 81 ...
1 6 36 216 1296 ...
1 10 100 1000 10000 ...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|