This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A376782 #18 Oct 04 2024 23:23:05 %S A376782 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 A376782 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 A376782 0,2,1,0,1,1,4,6,9,21,34,39,71,74,77,99,118,124,107,129 %N 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). %H A376782 Max Alekseyev, <a href="/A376782/b376782.txt">Table of k, a(k) for k = 1..209</a> (rows n = 1..8 flattened) %H A376782 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 A376782 Triangle starts with %e A376782 n = 1: 1 %e A376782 n = 2: 1 1 %e A376782 n = 3: 1 3 %e A376782 n = 4: 1 4 4 2 %e A376782 n = 5: 1 4 8 13 8 %e A376782 n = 6: 1 4 5 7 20 34 31 28 12 8 5 0 1 %e A376782 ... %Y A376782 Cf. A000088 (row sums), A371162 (row lengths), A000012 (column m=1), A113311 (column m=2). %Y A376782 Cf. A002865, A006897, A103221, A371161, A376780, A376781. %K A376782 nonn,tabf %O A376782 1,5 %A A376782 _Max Alekseyev_, Oct 03 2024