login
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).
3

%I #18 Oct 04 2024 23:23:05

%S 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,

%T 26,33,43,59,50,62,58,60,64,67,63,70,68,65,61,60,31,28,16,8,13,4,4,4,

%U 0,2,1,0,1,1,4,6,9,21,34,39,71,74,77,99,118,124,107,129

%N 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).

%H Max Alekseyev, <a href="/A376782/b376782.txt">Table of k, a(k) for k = 1..209</a> (rows n = 1..8 flattened)

%H Max A. Alekseyev and Allan Bickle, <a href="https://allanbickle.wordpress.com/wp-content/uploads/2016/05/forbidsubfinal.pdf">Forbidden Subgraphs of Single Graphs</a>, 2024.

%e Triangle starts with

%e n = 1: 1

%e n = 2: 1 1

%e n = 3: 1 3

%e n = 4: 1 4 4 2

%e n = 5: 1 4 8 13 8

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

%e ...

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

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

%K nonn,tabf

%O 1,5

%A _Max Alekseyev_, Oct 03 2024