login
A263343
Triangle read by rows: T(n,k) is the number of graphs with n vertices containing exactly k non-isomorphic subgraphs.
0
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
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: A293019 A376590 A087479 * A326413 A329171 A326918
KEYWORD
nonn,tabf
AUTHOR
Christian Stump, Oct 15 2015
STATUS
approved