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.

A124324 Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 4
6 1
7 11
8 3
9 1
10 26
11 25
12 1
13 57
14 130
15 15
16 1
17 120
18 546
19 210
20 1
21 247
22 2037
23 1750
24 105
25 1
26 502
27 7071
28 11368
29 2205
30 1
31 1013
32 23436
33 63805
34 26775
35 945
36 1
37 2036
38 75328
39 325930
40 247555
41 27720
42 1
43 4083
44 237127
45 1561516
46 1939630
47 460845
48 10395
49 1
50 8178

List of values

[1, 1, 1, 1, 1, 4, 1, 11, 3, 1, 26, 25, 1, 57, 130, 15, 1, 120, 546, 210, 1, 247, 2037, 1750, 105, 1, 502, 7071, 11368, 2205, 1, 1013, 23436, 63805, 26775, 945, 1, 2036, 75328, 325930, 247555, 27720, 1, 4083, 237127, 1561516, 1939630, 460845, 10395, 1, 8178]