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.

A119646 a(n) = maximum number of partitions of n into 3 parts, each having the same product.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 2, 2, 2, 2, 3, 3, 2, 2, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3]