A237049 - cp's OEIS frontend

A237049 Number of ordered ways to write n = i + j + k (0 < i <= j <= k) with i,j,k not all equal such that sigma(i)sigma(j)sigma(k) is a cube, where sigma(m) denotes the sum of all positive divisors of m.

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

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 1, 2, 1, 0, 0, 2, 2, 1, 1, 1, 3, 4, 2, 3, 3, 1, 2, 3, 2, 3, 2, 2, 3, 2, 1, 0, 5, 3, 4, 3, 1, 2, 4, 1, 2, 3, 5, 7, 5, 6, 3, 4, 6, 7, 6, 7, 3, 8, 2, 7, 6, 4, 3, 8, 7, 6, 6, 2, 7, 5, 7, 2, 8, 4, 8, 6, 5, 7, 7, 9, 10, 5, 9, 7, 11, 3, 6, 7, 8, 8, 7, 5, 6, 5]

cp's OEIS Frontend

A237049 Number of ordered ways to write n = i + j + k (0 < i <= j <= k) with i,j,k not all equal such that sigma(i)sigma(j)sigma(k) is a cube, where sigma(m) denotes the sum of all positive divisors of m.

Table of values

List of values

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

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

cp's OEIS Frontend

A237049 Number of ordered ways to write n = i + j + k (0 < i <= j <= k) with i,j,k not all equal such that sigma(i)*sigma(j)*sigma(k) is a cube, where sigma(m) denotes the sum of all positive divisors of m.

Table of values

List of values

A237049 Number of ordered ways to write n = i + j + k (0 < i <= j <= k) with i,j,k not all equal such that sigma(i)sigma(j)sigma(k) is a cube, where sigma(m) denotes the sum of all positive divisors of m.

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