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.

A054924 Triangle read by rows: T(n,k) = number of nonisomorphic unlabeled connected graphs with n nodes and k edges (n >= 1, 0 <= k <= n(n-1)/2).

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 0
6 1
7 1
8 0
9 0
10 0
11 2
12 2
13 1
14 1
15 0
16 0
17 0
18 0
19 3
20 5
21 5
22 4
23 2
24 1
25 1
26 0
27 0
28 0
29 0
30 0
31 6
32 13
33 19
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 0
47 0
48 11
49 33
50 67
51 107
52 132
53 138
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 0
69 0
70 0
71 23
72 89
73 236
74 486
75 814
76 1169
77 1454
78 1579
79 1515
80 1290
81 970
82 658
83 400
84 220
85 114

List of values

[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 2, 1, 1, 0, 0, 0, 0, 3, 5, 5, 4, 2, 1, 1, 0, 0, 0, 0, 0, 6, 13, 19, 22, 20, 14, 9, 5, 2, 1, 1, 0, 0, 0, 0, 0, 0, 11, 33, 67, 107, 132, 138, 126, 95, 64, 40, 21, 10, 5, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 23, 89, 236, 486, 814, 1169, 1454, 1579, 1515, 1290, 970, 658, 400, 220, 114]