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.

A046752 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) loopless multigraphs with n edges on k nodes and degree >= 3 at each node, n >= 3, 2 <= k <= floor(2*n/3).

Table of values

n a(n)
3 1
4 1
5 1
6 1
7 1
8 2
9 2
10 1
11 3
12 5
13 1
14 4
15 13
16 4
17 1
18 6
19 26
20 24
21 5
22 1
23 7
24 47
25 84
26 38
27 1
28 9
29 78
30 233
31 216
32 23
33 1
34 11
35 126
36 557
37 914
38 314
39 16
40 1
41 13
42 188
43 1193
44 3077
45 2270
46 325
47 1
48 15
49 276
50 2355
51 8915
52 11592
53 4015
54 162
55 1
56 18
57 391
58 4370
59 23008
60 47079
61 31443
62 4495
63 66

List of values

[1, 1, 1, 1, 1, 2, 2, 1, 3, 5, 1, 4, 13, 4, 1, 6, 26, 24, 5, 1, 7, 47, 84, 38, 1, 9, 78, 233, 216, 23, 1, 11, 126, 557, 914, 314, 16, 1, 13, 188, 1193, 3077, 2270, 325, 1, 15, 276, 2355, 8915, 11592, 4015, 162, 1, 18, 391, 4370, 23008, 47079, 31443, 4495, 66]