|
Search: id:A062734
|
|
|
| A062734 |
|
Triangular array T(n,k) giving number of connected graphs with n labeled nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2). |
|
+0
6
|
|
| 1, 0, 1, 0, 0, 3, 1, 0, 0, 0, 16, 15, 6, 1, 0, 0, 0, 0, 125, 222, 205, 120, 45, 10, 1, 0, 0, 0, 0, 0, 1296, 3660, 5700, 6165, 4945, 2997, 1365, 455, 105, 15, 1, 0, 0, 0, 0, 0, 0, 16807, 68295, 156555, 258125, 331506, 343140, 290745, 202755, 116175, 54257, 20349
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
FORMULA
|
Sum_{n,k} T(n,k) x^n/n! y^k = 1+ln(Sum((1+y)^binomial(n, 2)*x^n/n!, n=0..infinity)). - Ralf Stephan, Jan 18 2005
|
|
EXAMPLE
|
[1], [0, 1], [0, 0, 3, 1], [0, 0, 0, 16, 15, 6, 1], [0, 0, 0, 0, 125, 222, 205, 120, 45, 10, 1], ...
|
|
CROSSREFS
|
Cf. (row sums) A001187, (unlabeled case) A054924.
See A123527 for another version (without leading zeros in each row).
Sequence in context: A154721 A144209 A094544 this_sequence A117389 A122083 A098158
Adjacent sequences: A062731 A062732 A062733 this_sequence A062735 A062736 A062737
|
|
KEYWORD
|
easy,nonn,tabf
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 12 2001
|
|
|
Search completed in 0.002 seconds
|
