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 A376780 #12 Oct 04 2024 23:24:40 %S A376780 1,2,1,2,2,2,1,2,3,2,3,2,2,1,2,3,2,3,3,4,3,3,2,2,1,2,3,3,2,4,3,4,5,5, %T A376780 4,5,5,4,2,2,1,2,3,3,2,4,4,3,4,5,4,5,5,7,6,6,5,5,4,4,2,2,1,2,3,3,3,2, %U A376780 4,4,3,5,6,5,6,5,5,7,6,7,10,9,9,9,8,10,5,5,4,2,2,1 %N A376780 Triangular table read by rows: T(n,k) is the minimum number of minimal forbidden subgraphs of a graph with n vertices and k edges, n >= 1, 0 <= k <= n*(n-1)/2. %H A376780 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 A376780 Table starts with %e A376780 n = 1: 1 %e A376780 n = 2: 2, 1 %e A376780 n = 3: 2, 2, 2, 1 %e A376780 n = 4: 2, 3, 2, 3, 2, 2, 1 %e A376780 ... %Y A376780 Cf. A002865, A006897, A103221, A371161, A371162, A376781, A376782. %K A376780 nonn,tabf %O A376780 1,2 %A A376780 _Max Alekseyev_, Oct 03 2024