A248568 - cp's OEIS frontend

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

n	a(n)
1	1
2	2
3	6
4	2
5	20
6	4
7	8
8	4
9	12
10	40
11	24
12	6
13	20
14	12
15	24
16	8
17	48
18	16
19	32
20	18
21	24
22	8
23	72
24	12
25	44
26	40
27	36
28	24
29	132
30	12
31	56
32	16
33	60
34	96
35	40
36	18
37	180
38	36
39	60
40	36
41	144
42	40
43	80
44	16
45	72
46	20
47	168
48	24
49	92
50	88
51	184
52	80
53	276
54	24
55	104
56	42
57	48
58	264
59	312
60	24

[1, 2, 6, 2, 20, 4, 8, 4, 12, 40, 24, 6, 20, 12, 24, 8, 48, 16, 32, 18, 24, 8, 72, 12, 44, 40, 36, 24, 132, 12, 56, 16, 60, 96, 40, 18, 180, 36, 60, 36, 144, 40, 80, 16, 72, 20, 168, 24, 92, 88, 184, 80, 276, 24, 104, 42, 48, 264, 312, 24]

cp's OEIS Frontend

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

Table of values

List of values

n	a(n)
1	1
2	2
3	6
4	2
5	20
6	4
7	8
8	4
9	12
10	40
11	24
12	6
13	20
14	12
15	24
16	8
17	48
18	16
19	32
20	18
21	24
22	8
23	72
24	12
25	44
26	40
27	36
28	24
29	132
30	12
31	56
32	16
33	60
34	96
35	40
36	18
37	180
38	36
39	60
40	36
41	144
42	40
43	80
44	16
45	72
46	20
47	168
48	24
49	92
50	88
51	184
52	80
53	276
54	24
55	104
56	42
57	48
58	264
59	312
60	24

n	a(n)
1	1
2	2
3	6
4	2
5	20
6	4
7	8
8	4
9	12
10	40
11	24
12	6
13	20
14	12
15	24
16	8
17	48
18	16
19	32
20	18
21	24
22	8
23	72
24	12
25	44
26	40
27	36
28	24
29	132
30	12
31	56
32	16
33	60
34	96
35	40
36	18
37	180
38	36
39	60
40	36
41	144
42	40
43	80
44	16
45	72
46	20
47	168
48	24
49	92
50	88
51	184
52	80
53	276
54	24
55	104
56	42
57	48
58	264
59	312
60	24

n	a(n)
1	1
2	2
3	6
4	2
5	20
6	4
7	8
8	4
9	12
10	40
11	24
12	6
13	20
14	12
15	24
16	8
17	48
18	16
19	32
20	18
21	24
22	8
23	72
24	12
25	44
26	40
27	36
28	24
29	132
30	12
31	56
32	16
33	60
34	96
35	40
36	18
37	180
38	36
39	60
40	36
41	144
42	40
43	80
44	16
45	72
46	20
47	168
48	24
49	92
50	88
51	184
52	80
53	276
54	24
55	104
56	42
57	48
58	264
59	312
60	24