|
|
A350914
|
|
Triangle read by rows: T(n,k) is the number of unlabeled weakly connected oriented graphs with n arcs and k vertices, k = 1..n+1.
|
|
3
|
|
|
1, 0, 1, 0, 0, 3, 0, 0, 2, 8, 0, 0, 0, 12, 27, 0, 0, 0, 10, 68, 91, 0, 0, 0, 4, 127, 395, 350, 0, 0, 0, 0, 144, 1144, 2170, 1376, 0, 0, 0, 0, 107, 2393, 9139, 11934, 5743, 0, 0, 0, 0, 50, 3767, 28606, 67104, 64892, 24635, 0, 0, 0, 0, 12, 4500, 71583, 288331, 468702, 352286, 108968
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1;
0, 1;
0, 0, 3;
0, 0, 2, 8;
0, 0, 0, 12, 27;
0, 0, 0, 10, 68, 91;
0, 0, 0, 4, 127, 395, 350;
0, 0, 0, 0, 144, 1144, 2170, 1376;
...
|
|
PROG
|
(PARI) \\ See A350734 for G, InvEulerMTS.
T(n)={my(p=InvEulerMTS(sum(i=0, n, G(i, y+O(y^n))*x^i, O(x*x^n)))); vector(n, n, Vec(O(x^n)+polcoef(p, n-1, y)/x, -n))}
{ my(A=T(10)); for(n=1, #A, print(A[n])) }
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|