A063444 - cp's OEIS frontend

A063444 Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.

n	a(n)
1	3
2	12
3	13
4	15
5	121
6	35
7	86
8	64
9	37
10	99
11	726
12	72
13	158
14	196
15	61
16	96
17	4931
18	73
19	7639
20	175
21	343
22	267
23	2302
24	104
25	250
26	676
27	162
28	637
29	3481
30	154
31	21142
32	192
33	2178
34	411
35	5041
36	814
37	446
38	1145
39	157
40	164
41	6971
42	1348
43	14878
44	1334
45	542
46	2115
47	22090
48	193
49	2842
50	2200

[3, 12, 13, 15, 121, 35, 86, 64, 37, 99, 726, 72, 158, 196, 61, 96, 4931, 73, 7639, 175, 343, 267, 2302, 104, 250, 676, 162, 637, 3481, 154, 21142, 192, 2178, 411, 5041, 814, 446, 1145, 157, 164, 6971, 1348, 14878, 1334, 542, 2115, 22090, 193, 2842, 2200]

cp's OEIS Frontend

A063444 Smallest number such that GCD of EulerPhi of 2 consecutive integer equals 2n.

Table of values

List of values