A061780 - cp's OEIS frontend

A061780 Number of solutions to x + y + z = 0 mod (2n+1) such that x,y,z are units modulo 2n+1, i.e., gcd(x, 2n+1) = gcd(y, 2n+1) = gcd(z, 2n+1) = 1.

n	a(n)
1	2
2	12
3	30
4	18
5	90
6	132
7	24
8	240
9	306
10	60
11	462
12	300
13	162
14	756
15	870
16	180
17	360
18	1260
19	264
20	1560
21	1722
22	216
23	2070
24	1470
25	480
26	2652
27	1080
28	612
29	3306
30	3540
31	540
32	1584
33	4290
34	924
35	4830
36	5112
37	600
38	2700
39	6006
40	1458
41	6642
42	2880
43	1512
44	7656
45	3960
46	1740
47	3672
48	9120

[2, 12, 30, 18, 90, 132, 24, 240, 306, 60, 462, 300, 162, 756, 870, 180, 360, 1260, 264, 1560, 1722, 216, 2070, 1470, 480, 2652, 1080, 612, 3306, 3540, 540, 1584, 4290, 924, 4830, 5112, 600, 2700, 6006, 1458, 6642, 2880, 1512, 7656, 3960, 1740, 3672, 9120]

cp's OEIS Frontend

A061780 Number of solutions to x + y + z = 0 mod (2n+1) such that x,y,z are units modulo 2n+1, i.e., gcd(x, 2n+1) = gcd(y, 2n+1) = gcd(z, 2n+1) = 1.

Table of values

List of values