cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A070017 Least numbers m such that GCD of two consecutive values of cototients, i.e., gcd(cototient(m+1), cototient(m)) equals 2n - 1.

Table of values

n a(n)
1 2
2 9
3 38
4 392
5 135
6 120
7 362
8 116
9 745
10 1183
11 294
12 528
13 1395
14 428
15 1378
16 2602
17 1185
18 203
19 2313
20 3042
21 1966
22 3549
23 1431
24 551
25 7838
26 4076
27 473
28 2635
29 903
30 2044
31 13178
32 942
33 6819
34 12418
35 1188
36 2264
37 3282
38 1775
39 1517
40 2127
41 24380
42 2884
43 2035
44 11481

List of values

[2, 9, 38, 392, 135, 120, 362, 116, 745, 1183, 294, 528, 1395, 428, 1378, 2602, 1185, 203, 2313, 3042, 1966, 3549, 1431, 551, 7838, 4076, 473, 2635, 903, 2044, 13178, 942, 6819, 12418, 1188, 2264, 3282, 1775, 1517, 2127, 24380, 2884, 2035, 11481]