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.

A380622 Array read by antidiagonals: T(n,k) is the number of rooted k-regular combinatorial maps with n vertices, n >= 0, k >= 1.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 1
6 1
7 0
8 1
9 0
10 1
11 3
12 5
13 1
14 0
15 1
16 0
17 24
18 0
19 1
20 0
21 1
22 15
23 189
24 297
25 60
26 1
27 0
28 1
29 0
30 1695
31 0
32 4896
33 0
34 1
35 0
36 1
37 105
38 19305
39 472200
40 869400
41 100278
42 1105
43 1
44 0
45 1
46 0
47 252000
48 0
49 242183775
50 0
51 2450304
52 0
53 1
54 0
55 1
56 945
57 3828825
58 2465608950
59 103694490900
60 198147676875
61 16482741030
62 69533397
63 27120
64 1
65 0

List of values

[1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 3, 5, 1, 0, 1, 0, 24, 0, 1, 0, 1, 15, 189, 297, 60, 1, 0, 1, 0, 1695, 0, 4896, 0, 1, 0, 1, 105, 19305, 472200, 869400, 100278, 1105, 1, 0, 1, 0, 252000, 0, 242183775, 0, 2450304, 0, 1, 0, 1, 945, 3828825, 2465608950, 103694490900, 198147676875, 16482741030, 69533397, 27120, 1, 0]