A263099 Triangle read by rows: T(n,k) is the number of graphs with n vertices and k acyclic orientations.

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

Table of n, a(n) for n=0..99.

FindStat - Combinatorial Statistic Finder, The number of acyclic orientations of a graph.

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

Adjacent sequences: A263096 A263097 A263098 * A263100 A263101 A263102

Keyword

nonn,tabf

Author

Christian Stump, Oct 15 2015

Status

approved