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.

A370167 Irregular triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with k = 0..binomial(n,2) edges.

Table of values

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

List of values

[1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 2, 1, 1, 0, 0, 0, 1, 4, 5, 5, 4, 2, 1, 1, 0, 0, 0, 1, 3, 9, 15, 20, 22, 20, 14, 9, 5, 2, 1, 1, 0, 0, 0, 0, 1, 6, 20, 41, 73, 110, 133, 139, 126, 95, 64, 40, 21, 10, 5, 2, 1, 1, 0, 0, 0, 0, 1, 3, 15, 50, 124, 271, 515, 832, 1181, 1460, 1581, 1516, 1291, 970, 658, 400, 220, 114, 56, 24, 11, 5, 2, 1, 1]