A248035 - cp's OEIS frontend

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

n	a(n)
1	1
2	3
3	2
4	1
5	15
6	14
7	3
8	8
9	9
10	30
11	30
12	14
13	7
14	6
15	5
16	9
17	3
18	8
19	55
20	60
21	9
22	4
23	83
24	28
25	25
26	71
27	9
28	1
29	24
30	4
31	43
32	32
33	1523
34	30
35	13
36	9
37	35
38	3
39	21
40	24
41	17
42	18
43	7
44	8
45	99
46	166
47	5
48	4
49	3
50	32
51	205
52	6
53	36
54	18
55	19
56	19
57	40
58	78
59	9
60	8

[1, 3, 2, 1, 15, 14, 3, 8, 9, 30, 30, 14, 7, 6, 5, 9, 3, 8, 55, 60, 9, 4, 83, 28, 25, 71, 9, 1, 24, 4, 43, 32, 1523, 30, 13, 9, 35, 3, 21, 24, 17, 18, 7, 8, 99, 166, 5, 4, 3, 32, 205, 6, 36, 18, 19, 19, 40, 78, 9, 8]

cp's OEIS Frontend

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

Table of values

List of values