A376782 - OEIS

A376782

Triangle read by rows: T(n,m) is the number of unlabeled graphs with n vertices having m minimum forbidden subgraphs, n >= 1, 1 <= m <= A371162(n).

1, 1, 1, 1, 3, 1, 4, 4, 2, 1, 4, 8, 13, 8, 1, 4, 5, 7, 20, 34, 31, 28, 12, 8, 5, 0, 1, 1, 4, 5, 13, 26, 33, 43, 59, 50, 62, 58, 60, 64, 67, 63, 70, 68, 65, 61, 60, 31, 28, 16, 8, 13, 4, 4, 4, 0, 2, 1, 0, 1, 1, 4, 6, 9, 21, 34, 39, 71, 74, 77, 99, 118, 124, 107, 129

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

OFFSET

1,5

LINKS

Max Alekseyev, Table of k, a(k) for k = 1..209 (rows n = 1..8 flattened)

Max A. Alekseyev and Allan Bickle, Forbidden Subgraphs of Single Graphs, 2024.

EXAMPLE

Triangle starts with

n = 1: 1

n = 2: 1 1

n = 3: 1 3

n = 4: 1 4 4 2

n = 5: 1 4 8 13 8

n = 6: 1 4 5 7 20 34 31 28 12 8 5 0 1

...

CROSSREFS

Cf. A000088 (row sums), A371162 (row lengths), A000012 (column m=1), A113311 (column m=2).

Cf. A002865, A006897, A103221, A371161, A376780, A376781.

Sequence in context: A125608 A182001 A099813 * A141300 A260502 A014388

Adjacent sequences: A376779 A376780 A376781 * A376783 A376784 A376785

KEYWORD

nonn,tabf

AUTHOR

Max Alekseyev, Oct 03 2024

STATUS

approved