A248058 - cp's OEIS frontend

A248058 Least positive integer m such that m*n divides phi(m^2+n^2), where phi(.) is Euler's totient function.

n	a(n)
1	1
2	1
3	2
4	1
5	4
6	1
7	8
8	1
9	10
10	1
11	726
12	2
13	12
14	1
15	4
16	1
17	18
18	3
19	20
20	1
21	96
22	23
23	22
24	1
25	24
26	1
27	72
28	2
29	30
30	8
31	30
32	1
33	32
34	35
35	34
36	1
37	222
38	40
39	26
40	1
41	1312
42	43
43	42
44	46
45	360
46	44
47	48
48	2
49	588
50	1
51	50
52	2
53	5100
54	1
55	88
56	1
57	19152
58	60
59	8
60	16

[1, 1, 2, 1, 4, 1, 8, 1, 10, 1, 726, 2, 12, 1, 4, 1, 18, 3, 20, 1, 96, 23, 22, 1, 24, 1, 72, 2, 30, 8, 30, 1, 32, 35, 34, 1, 222, 40, 26, 1, 1312, 43, 42, 46, 360, 44, 48, 2, 588, 1, 50, 2, 5100, 1, 88, 1, 19152, 60, 8, 16]

cp's OEIS Frontend

A248058 Least positive integer m such that m*n divides phi(m^2+n^2), where phi(.) is Euler's totient function.

Table of values

List of values