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.

A211350 Refined triangle A124323: T(n,k) is the number of partitions of an n-set that are of type k (k-th integer partition, defined by A194602).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 6
9 4
10 3
11 1
12 1
13 10
14 10
15 15
16 5
17 10
18 1
19 1
20 15
21 20
22 45
23 15
24 60
25 6
26 15
27 15
28 10
29 1
30 1
31 21
32 35
33 105
34 35
35 210
36 21
37 105
38 105
39 70
40 7
41 105
42 21
43 35
44 1
45 1
46 28
47 56
48 210
49 70
50 560
51 56
52 420
53 420
54 280
55 28
56 840
57 168
58 280
59 8
60 105
61 210
62 280
63 28

List of values

[1, 1, 1, 1, 3, 1, 1, 6, 4, 3, 1, 1, 10, 10, 15, 5, 10, 1, 1, 15, 20, 45, 15, 60, 6, 15, 15, 10, 1, 1, 21, 35, 105, 35, 210, 21, 105, 105, 70, 7, 105, 21, 35, 1, 1, 28, 56, 210, 70, 560, 56, 420, 420, 280, 28, 840, 168, 280, 8, 105, 210, 280, 28]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.