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.

A226505 Irregular triangle read by rows: T(n,k) = number of set partitions of [1..n] with intertwining weight k.

Table of values

n a(n)
0 1
1 1
2 2
3 5
4 14
5 1
6 42
7 9
8 1
9 132
10 55
11 14
12 2
13 429
14 286
15 120
16 35
17 6
18 1
19 1430
20 1365
21 819
22 364
23 119
24 35
25 7
26 1
27 4862
28 6188
29 4900
30 2940
31 1394
32 586
33 203
34 59
35 13
36 2
37 16796
38 27132
39 26928
40 20400
41 12576
42 6846
43 3246
44 1358
45 493
46 153
47 38
48 8
49 1

List of values

[1, 1, 2, 5, 14, 1, 42, 9, 1, 132, 55, 14, 2, 429, 286, 120, 35, 6, 1, 1430, 1365, 819, 364, 119, 35, 7, 1, 4862, 6188, 4900, 2940, 1394, 586, 203, 59, 13, 2, 16796, 27132, 26928, 20400, 12576, 6846, 3246, 1358, 493, 153, 38, 8, 1]