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.

A263321 Least positive integer m such that the numbers phi(k)*pi(k^2) (k = 1..n) are pairwise incongruent modulo m.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 11
6 13
7 16
8 19
9 19
10 19
11 29
12 29
13 29
14 37
15 37
16 59
17 59
18 59
19 59
20 59
21 59
22 59
23 59
24 101
25 101
26 101
27 133
28 133
29 133
30 133
31 173
32 173
33 173
34 173
35 173
36 173
37 173
38 173
39 173
40 173
41 173
42 173
43 175
44 245
45 269
46 269
47 269
48 269
49 379
50 379

List of values

[1, 3, 5, 7, 11, 13, 16, 19, 19, 19, 29, 29, 29, 37, 37, 59, 59, 59, 59, 59, 59, 59, 59, 101, 101, 101, 133, 133, 133, 133, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 173, 175, 245, 269, 269, 269, 269, 379, 379]