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.

A349537 Least positive integer m such that the n numbers 33*k^2*(k^3+1) (k = 1..n) are pairwise distinct modulo m.

Table of values

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

List of values

[1, 4, 7, 7, 13, 13, 13, 13, 13, 31, 41, 41, 61, 61, 61, 61, 61, 61, 61, 73, 101, 137, 137, 137, 137, 137, 137, 137, 137, 233, 233, 233, 233, 233, 233, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 349, 547, 547, 547, 547, 547, 547, 547, 547, 547, 547, 859, 859, 859, 859, 859, 859]