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.

A266871 Number of partitions of n that maximize the product of multiplicities of parts.

Table of values

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

List of values

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