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.

A247672 Least integer m > 0 with pi(m*n) = phi(m) + phi(n), where pi(.) is the prime-counting function and phi(.) is Euler's totient function.

Table of values

n a(n)
1 6
2 2
3 2
4 23
5 3
6 1
7 3
8 1033
9 2
10 6449
11 15887
12 1
13 100169
14 268393
15 636917
16 2113589
17 70324093
18 1
19 27852457
20 78848479
21 2
22 468329417
23 4
24 1
25 10220118551

List of values

[6, 2, 2, 23, 3, 1, 3, 1033, 2, 6449, 15887, 1, 100169, 268393, 636917, 2113589, 70324093, 1, 27852457, 78848479, 2, 468329417, 4, 1, 10220118551]