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.

A255404 Number of different integer partitions of n that produce the maximum number of set partitions for a set of cardinality n.

Table of values

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

List of values

[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 3, 2, 1, 4, 2, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 4, 6, 4, 1, 2, 1, 5, 5, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 5, 2, 2, 1, 1, 4, 1, 1, 2, 3, 1, 8, 2, 1, 1, 3, 1, 1, 1, 3, 1, 1, 3, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 3, 2, 1, 1, 1, 1]