A263343 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

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,