login
A263099
Triangle read by rows: T(n,k) is the number of graphs with n vertices and k acyclic orientations.
0
1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 2, 0, 1, 0, 2, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 2, 0, 1, 0, 3, 0, 0, 0, 2, 0, 1, 0, 3, 0, 1, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0
OFFSET
0,13
COMMENTS
Row sums give A000088.
LINKS
EXAMPLE
Triangle begins:
1,
1,
1,1,
1,1,0,1,0,1,
1,1,0,2,0,1,0,2,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,
...
CROSSREFS
Cf. A000088.
Sequence in context: A091728 A108069 A227837 * A254001 A089734 A321375
KEYWORD
nonn,tabf
AUTHOR
Christian Stump, Oct 15 2015
STATUS
approved