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.

A349459 Least positive integer m such that the n numbers k^2*(k^2-1) (k=1..n) are pairwise distinct modulo m.

Table of values

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

List of values

[1, 5, 7, 11, 13, 23, 23, 23, 23, 41, 41, 41, 41, 41, 41, 101, 101, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 107, 223, 223, 223, 223, 223, 223, 223, 223, 223, 223, 229, 239, 239, 239, 383, 383, 383, 383, 383, 383, 383, 383, 401, 401, 557, 557, 557, 557, 557, 557, 557, 557, 557, 557, 557, 733, 733, 733, 733, 733, 733, 733]