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.

A306437 Regular triangle read by rows where T(n,k) is the number of non-crossing set partitions of {1, ..., n} in which all blocks have size k.

Table of values

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

List of values

[1, 1, 1, 1, 0, 1, 1, 2, 0, 1, 1, 0, 0, 0, 1, 1, 5, 3, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 14, 0, 4, 0, 0, 0, 1, 1, 0, 12, 0, 0, 0, 0, 0, 1, 1, 42, 0, 0, 5, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 132, 55, 22, 0, 6, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 429, 0, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 1]