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.

A355755 Irregular triangle read by rows: T(n,k) is the number of unlabeled connected n-node graphs with intersection number (or edge clique cover number) k; n >= 1, 0 <= k <= floor(n^2/4).

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 2
10 2
11 1
12 0
13 1
14 4
15 7
16 6
17 2
18 1
19 0
20 1
21 6
22 22
23 36
24 27
25 13
26 4
27 2
28 1
29 0
30 1
31 9
32 53
33 161
34 242
35 209
36 111
37 43
38 17
39 5
40 1
41 1
42 0
43 1
44 12
45 114
46 611
47 1766
48 2903
49 2793
50 1723
51 773
52 284
53 86
54 36
55 9
56 3
57 2
58 1
59 0
60 1
61 16
62 221
63 1987
64 10517
65 33078
66 60639
67 67379
68 48035
69 24628
70 9715
71 3349
72 1049
73 310
74 105
75 36
76 9
77 4
78 1
79 1

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 2, 2, 1, 0, 1, 4, 7, 6, 2, 1, 0, 1, 6, 22, 36, 27, 13, 4, 2, 1, 0, 1, 9, 53, 161, 242, 209, 111, 43, 17, 5, 1, 1, 0, 1, 12, 114, 611, 1766, 2903, 2793, 1723, 773, 284, 86, 36, 9, 3, 2, 1, 0, 1, 16, 221, 1987, 10517, 33078, 60639, 67379, 48035, 24628, 9715, 3349, 1049, 310, 105, 36, 9, 4, 1, 1]