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.

A222713 Least number k such that n divides gcd(sigma(k), phi(k)) (A009223).

Table of values

n a(n)
1 1
2 3
3 14
4 12
5 88
6 14
7 116
8 15
9 190
10 88
11 989
12 35
13 477
14 116
15 209
16 105
17 6901
18 190
19 7067
20 88
21 196
22 989
23 6439
24 35
25 15049
26 477
27 2754
28 172
29 10207
30 209
31 4976
32 336
33 989
34 6901
35 1189
36 190
37 10877
38 7067
39 477
40 248
41 13529
42 377
43 44461
44 989
45 418
46 6439
47 79523
48 105
49 10244
50 15049

List of values

[1, 3, 14, 12, 88, 14, 116, 15, 190, 88, 989, 35, 477, 116, 209, 105, 6901, 190, 7067, 88, 196, 989, 6439, 35, 15049, 477, 2754, 172, 10207, 209, 4976, 336, 989, 6901, 1189, 190, 10877, 7067, 477, 248, 13529, 377, 44461, 989, 418, 6439, 79523, 105, 10244, 15049]