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.

A056860 Triangle T(n,k) = number of element-subset partitions of {1..n} with n-k+1 equalities (n >= 1, 1 <= k <= n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 2
7 1
8 3
9 6
10 5
11 1
12 4
13 12
14 20
15 15
16 1
17 5
18 20
19 50
20 75
21 52
22 1
23 6
24 30
25 100
26 225
27 312
28 203
29 1
30 7
31 42
32 175
33 525
34 1092
35 1421
36 877
37 1
38 8
39 56
40 280
41 1050
42 2912
43 5684
44 7016
45 4140
46 1
47 9
48 72
49 420
50 1890
51 6552
52 17052
53 31572
54 37260
55 21147

List of values

[1, 1, 1, 1, 2, 2, 1, 3, 6, 5, 1, 4, 12, 20, 15, 1, 5, 20, 50, 75, 52, 1, 6, 30, 100, 225, 312, 203, 1, 7, 42, 175, 525, 1092, 1421, 877, 1, 8, 56, 280, 1050, 2912, 5684, 7016, 4140, 1, 9, 72, 420, 1890, 6552, 17052, 31572, 37260, 21147]