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.

A143841 Table read by antidiagonals: T(n,k) is the number of strongly connected directed multigraphs with loops with n arcs and up to k vertices.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 0, 1, 1, 2, 3, 1, 0, 1, 1, 2, 4, 7, 1, 0, 1, 1, 2, 4, 11, 11, 1, 0, 1, 1, 2, 4, 12, 30, 20, 1, 0, 1, 1, 2, 4, 12, 36, 93, 29, 1, 0, 1, 1, 2, 4, 12, 37, 152, 237, 45, 1, 0, 1, 1, 2, 4, 12, 37, 161, 587, 579, 61, 1, 0]