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.

A370420 Number of genus g partitions of the n-set which are partitions into k nonempty subsets (blocks). Flattened 3-dimensional array read by n, then by g:0..floor(n-1)/2, then by k:1..n.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 6
9 6
10 1
11 0
12 1
13 0
14 0
15 1
16 10
17 20
18 10
19 1
20 0
21 5
22 5
23 0
24 0
25 1
26 15
27 50
28 50
29 15
30 1
31 0
32 15
33 40
34 15
35 0
36 0
37 0
38 1
39 0
40 0
41 0
42 0
43 1
44 21
45 105
46 175
47 105
48 21
49 1
50 0
51 35
52 175
53 175
54 35
55 0
56 0
57 0
58 7
59 21
60 0
61 0
62 0
63 0
64 1
65 28
66 196
67 490
68 490
69 196
70 28
71 1
72 0
73 70
74 560
75 1050
76 560
77 70
78 0
79 0
80 0
81 28
82 210
83 161
84 0
85 0
86 0
87 0
88 0
89 1
90 0
91 0
92 0
93 0
94 0
95 0

List of values

[1, 1, 1, 1, 3, 1, 1, 6, 6, 1, 0, 1, 0, 0, 1, 10, 20, 10, 1, 0, 5, 5, 0, 0, 1, 15, 50, 50, 15, 1, 0, 15, 40, 15, 0, 0, 0, 1, 0, 0, 0, 0, 1, 21, 105, 175, 105, 21, 1, 0, 35, 175, 175, 35, 0, 0, 0, 7, 21, 0, 0, 0, 0, 1, 28, 196, 490, 490, 196, 28, 1, 0, 70, 560, 1050, 560, 70, 0, 0, 0, 28, 210, 161, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0]