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.

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

Table of values

n a(n)
7 5
8 8
9 3
10 14
11 9
12 20
13 11
14 10
15 9
16 16
17 7
18 18
19 5
20 12
21 3
22 38
23 21
24 8
25 15
26 58
27 9
28 20
29 11
30 18
31 14
32 32
33 7
34 14
35 13
36 12
37 35
38 22
39 9
40 24
41 7
42 46
43 13
44 31
45 3
46 42
47 45
48 16
49 11
50 30
51 13
52 44
53 19
54 27
55 25
56 40
57 15
58 26
59 28
60 36
61 35
62 28
63 9
64 64
65 7
66 54
67 21
68 28
69 19
70 26

List of values

[5, 8, 3, 14, 9, 20, 11, 10, 9, 16, 7, 18, 5, 12, 3, 38, 21, 8, 15, 58, 9, 20, 11, 18, 14, 32, 7, 14, 13, 12, 35, 22, 9, 24, 7, 46, 13, 31, 3, 42, 45, 16, 11, 30, 13, 44, 19, 27, 25, 40, 15, 26, 28, 36, 35, 28, 9, 64, 7, 54, 21, 28, 19, 26]