A263343 Triangle read by rows: T(n,k) is the number of graphs with n vertices containing exactly k non-isomorphic subgraphs.

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 0, 1, 0, 1, 1, 1, 1, 2, 2, 3, 1, 2, 3, 0, 1, 2, 3, 1, 0, 0, 1, 0, 3, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 2, 3, 3, 3, 3, 4, 1, 4, 4, 6, 1, 1, 1, 3, 1, 7, 1, 4, 1, 5, 2, 1, 2, 4, 0, 2, 2, 1, 1, 1, 3, 3, 2, 1, 3, 0, 0, 1, 1, 0, 2, 1, 2, 0, 2, 2

Offset

1,10

Comments

Row sums give A000088, n >= 1.

Links

Table of n, a(n) for n=1..100.

FindStat - Combinatorial Statistic Finder, The number of subgraphs.

Example

Triangle begins:
1,
1,1,
1,1,1,1,
1,1,2,2,1,1,0,1,0,1,1,
1,1,2,2,3,1,2,3,0,1,2,3,1,0,0,1,0,3,0,1,0,1,1,0,1,0,0,1,0,0,1,0,1,1,
...

Crossrefs

Cf. A000088.

Sequence in context: A345907 A293019 A087479 * A326413 A329171 A326918

Adjacent sequences: A263340 A263341 A263342 * A263344 A263345 A263346

Keyword

nonn,tabf

Author

Christian Stump, Oct 15 2015

Status

approved