|
Search: id:A070166
|
|
|
| A070166 |
|
Triangle read by rows giving T(n,k) = number of rooted graphs on n nodes with k edges (n >= 1, 0 <= k <= n(n-1)/2). |
|
+0
2
|
|
| 1, 1, 1, 1, 2, 2, 1, 1, 2, 4, 6, 4, 2, 1, 1, 2, 5, 11, 17, 18, 17, 11, 5, 2, 1, 1, 2, 5, 13, 29, 52, 76, 94, 94, 76, 52, 29, 13, 5, 2, 1, 1, 2, 5, 14, 35, 83, 173, 308, 487, 666, 774, 774, 666, 487, 308, 173, 83, 35, 14, 5, 2, 1, 1, 2, 5, 14, 37, 98, 252, 585, 1239, 2396, 4135, 6340
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
T(n,k) is also the number of graphs with n-1 nodes and k edges which may contain loops. (Delete the root node and change every edge leading to it into a loop.)
T(n,k) is also the number of symmetric relations with n-1 points and k relations.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Rooted Graphs
|
|
EXAMPLE
|
Triangle begins 1; 1,1; 1,2,2,1; 1,2,4,6,4,2,1; 1,2,5,11,17,18,17,11,5,2,1; ... (the last batch giving either the numbers of rooted graphs on 5 nodes, or the numbers of graphs with loops on 4 nodes; with from 0 to 10 edges).
|
|
CROSSREFS
|
Cf. A000666.
Sequence in context: A081372 A101489 A104156 this_sequence A131373 A034853 A110283
Adjacent sequences: A070163 A070164 A070165 this_sequence A070167 A070168 A070169
|
|
KEYWORD
|
nonn,tabf,nice
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu) and Eric Weisstein (eric(AT)weisstein.com), Apr 23, 2002
|
|
|
Search completed in 0.002 seconds
|
