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.

A376781 Triangular table read by rows: T(n,k) is the maximum 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 4
11 4
12 3
13 2
14 1
15 2
16 3
17 4
18 5
19 5
20 5
21 5
22 4
23 3
24 2
25 1
26 2
27 3
28 4
29 6
30 8
31 8
32 9
33 13
34 11
35 11
36 9
37 6
38 5
39 3
40 2
41 1
42 2
43 3
44 4
45 6
46 8
47 8
48 11
49 16
50 20
51 23
52 28
53 31
54 30
55 33
56 24
57 22
58 15
59 10
60 7
61 3
62 2
63 1
64 2
65 3
66 4
67 6
68 8
69 9
70 14
71 21
72 24
73 31
74 41
75 57
76 78
77 86
78 106
79 123
80 134
81 149
82 143
83 138
84 133
85 75
86 46
87 37
88 18
89 11
90 3
91 2
92 1

List of values

[1, 2, 1, 2, 2, 2, 1, 2, 3, 4, 4, 3, 2, 1, 2, 3, 4, 5, 5, 5, 5, 4, 3, 2, 1, 2, 3, 4, 6, 8, 8, 9, 13, 11, 11, 9, 6, 5, 3, 2, 1, 2, 3, 4, 6, 8, 8, 11, 16, 20, 23, 28, 31, 30, 33, 24, 22, 15, 10, 7, 3, 2, 1, 2, 3, 4, 6, 8, 9, 14, 21, 24, 31, 41, 57, 78, 86, 106, 123, 134, 149, 143, 138, 133, 75, 46, 37, 18, 11, 3, 2, 1]