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.

A369932 Triangle read by rows: T(n,k) is the number of unlabeled simple graphs with n edges and k vertices and without endpoints or isolated vertices.

Table of values

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

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 3, 2, 0, 0, 0, 0, 3, 5, 2, 0, 0, 0, 0, 2, 11, 9, 3, 0, 0, 0, 0, 1, 15, 32, 16, 4, 0, 0, 0, 0, 1, 12, 63, 76, 25, 5, 0, 0, 0, 0, 0, 8, 89, 234, 162, 39, 6, 0, 0, 0, 0, 0, 5, 97, 515, 730, 332, 60, 9]