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.

A290428 Array read by antidiagonals: T(n,k) is the number of graphs with n edges and k vertices, allowing loops and multi-edges.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 4, 1, 0, 1, 2, 6, 6, 1, 0, 1, 2, 7, 14, 9, 1, 0, 1, 2, 7, 20, 28, 12, 1, 0, 1, 2, 7, 22, 53, 52, 16, 1, 0, 1, 2, 7, 23, 69, 125, 93, 20, 1, 0, 1, 2, 7, 23, 76, 198, 287, 152, 25, 1, 0, 1, 2, 7, 23, 78, 245, 550, 606, 242, 30, 1, 0]