cp's OEIS Frontend

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.

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.

Table of values

n a(n)
1 1
2 2
3 1
4 2
5 2
6 2
7 1
8 2
9 3
10 2
11 3
12 2
13 2
14 1
15 2
16 3
17 2
18 3
19 3
20 4
21 3
22 3
23 2
24 2
25 1
26 2
27 3
28 3
29 2
30 4
31 3
32 4
33 5
34 5
35 4
36 5
37 5
38 4
39 2
40 2
41 1
42 2
43 3
44 3
45 2
46 4
47 4
48 3
49 4
50 5
51 4
52 5
53 5
54 7
55 6
56 6
57 5
58 5
59 4
60 4
61 2
62 2
63 1
64 2
65 3
66 3
67 3
68 2
69 4
70 4
71 3
72 5
73 6
74 5
75 6
76 5
77 5
78 7
79 6
80 7
81 10
82 9
83 9
84 9
85 8
86 10
87 5
88 5
89 4
90 2
91 2
92 1

List of values

[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, 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, 4, 4, 3, 5, 6, 5, 6, 5, 5, 7, 6, 7, 10, 9, 9, 9, 8, 10, 5, 5, 4, 2, 2, 1]