A078173 - cp's OEIS frontend

A078173 a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation rst = n * (r+s+t).

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

[1, 2, 3, 2, 3, 3, 3, 4, 4, 4, 4, 6, 3, 5, 5, 6, 4, 6, 5, 6, 7, 4, 5, 6, 5, 7, 9, 7, 6, 6, 5, 8, 9, 6, 8, 8, 3, 8, 9, 10, 7, 7, 5, 10, 9, 7, 7, 12, 7, 10, 9, 9, 7, 10, 11, 12, 9, 6, 7, 10, 7, 8, 11, 12, 13, 11, 5, 11, 9, 10, 9, 12, 5, 8, 15, 10, 12, 12, 9, 12, 12, 7, 8, 14, 15, 11, 11, 12, 10, 15]

cp's OEIS Frontend

A078173 a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation rst = n * (r+s+t).

Table of values

List of values

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

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

cp's OEIS Frontend

A078173 a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation r*s*t = n * (r+s+t).

Table of values

List of values

A078173 a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation rst = n * (r+s+t).

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