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.

A342557 T(n,m) is the number of unlabeled connected graphs without endpoints on m nodes with n edges, where T(n,m), m <= n, is a triangle read by rows.

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 1
22 0
23 0
24 0
25 0
26 3
27 5
28 1
29 0
30 0
31 0
32 0
33 2
34 11
35 8
36 1
37 0
38 0
39 0
40 0
41 1
42 15
43 31
44 12
45 1
46 0
47 0
48 0
49 0
50 1
51 12
52 63
53 71
54 16
55 1
56 0
57 0
58 0
59 0
60 0
61 8
62 89
63 231
64 144
65 21
66 1
67 0
68 0
69 0
70 0
71 0
72 5
73 97
74 513
75 707
76 274
77 27
78 1

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 3, 1, 0, 0, 0, 0, 3, 5, 1, 0, 0, 0, 0, 2, 11, 8, 1, 0, 0, 0, 0, 1, 15, 31, 12, 1, 0, 0, 0, 0, 1, 12, 63, 71, 16, 1, 0, 0, 0, 0, 0, 8, 89, 231, 144, 21, 1, 0, 0, 0, 0, 0, 5, 97, 513, 707, 274, 27, 1]