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.

A334546 Array read by antidiagonals: T(n,k) is the number of unlabeled connected loopless multigraphs with n nodes of degree k or less.

Table of values

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

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 0, 0, 1, 1, 3, 2, 0, 0, 1, 1, 4, 4, 2, 0, 0, 1, 1, 5, 9, 12, 2, 0, 0, 1, 1, 6, 14, 37, 22, 2, 0, 0, 1, 1, 7, 23, 93, 146, 68, 2, 0, 0, 1, 1, 8, 32, 203, 602, 772, 166, 2, 0, 0, 1, 1, 9, 46, 399, 2126, 5847, 4449, 534, 2, 0, 0]