A278648 - cp's OEIS frontend

A278648 Consider the set S of integers 1 through n. a(n) is the number of unordered ways in which three distinct elements {a, b, c} of S satisfy ab = cn.

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

[0, 0, 0, 0, 0, 0, 2, 0, 2, 1, 4, 0, 8, 0, 6, 8, 7, 0, 13, 0, 16, 12, 10, 0, 26, 6, 12, 13, 24, 0, 38, 0, 23, 20, 16, 24, 46, 0, 18, 24, 50, 0, 56, 0, 40, 49, 22, 0, 71, 15, 46, 32, 48, 0, 67, 40, 74, 36, 28, 0, 120, 0, 30, 73, 61, 48, 92, 0, 64, 44, 106, 0, 136, 0, 36, 86, 72, 60, 110]

cp's OEIS Frontend

A278648 Consider the set S of integers 1 through n. a(n) is the number of unordered ways in which three distinct elements {a, b, c} of S satisfy ab = cn.

Table of values

List of values

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

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

cp's OEIS Frontend

A278648 Consider the set S of integers 1 through n. a(n) is the number of unordered ways in which three distinct elements {a, b, c} of S satisfy a*b = c*n.

Table of values

List of values

A278648 Consider the set S of integers 1 through n. a(n) is the number of unordered ways in which three distinct elements {a, b, c} of S satisfy ab = cn.

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