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.

A129620 Square array read by falling antidiagonals: T(n,k) is the number of connected directed multigraphs with loops with n arcs and at most k vertices.

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 5
13 1
14 0
15 1
16 2
17 8
18 9
19 1
20 0
21 1
22 2
23 8
24 24
25 17
26 1
27 0
28 1
29 2
30 8
31 32
32 74
33 26
34 1
35 0
36 1
37 2
38 8
39 32
40 140
41 189
42 41
43 1
44 0
45 1
46 2
47 8
48 32
49 167
50 542
51 460
52 57
53 1
54 0
55 1
56 2
57 8
58 32
59 167
60 837
61 1964
62 989
63 81
64 1
65 0
66 1
67 2
68 8
69 32
70 167
71 928
72 4167
73 6291
74 2021
75 106
76 1
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 2, 5, 1, 0, 1, 2, 8, 9, 1, 0, 1, 2, 8, 24, 17, 1, 0, 1, 2, 8, 32, 74, 26, 1, 0, 1, 2, 8, 32, 140, 189, 41, 1, 0, 1, 2, 8, 32, 167, 542, 460, 57, 1, 0, 1, 2, 8, 32, 167, 837, 1964, 989, 81, 1, 0, 1, 2, 8, 32, 167, 928, 4167, 6291, 2021, 106, 1, 0]