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.

A192419 Smallest k such that 1^3, 2^3, 3^3,... n^3 are distinct modulo k.

Table of values

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

List of values

[1, 2, 3, 5, 5, 6, 10, 10, 10, 10, 11, 15, 15, 15, 15, 17, 17, 22, 22, 22, 22, 22, 23, 29, 29, 29, 29, 29, 29, 30, 33, 33, 33, 34, 41, 41, 41, 41, 41, 41, 41, 46, 46, 46, 46, 46, 47, 51, 51, 51, 51, 53, 53, 55, 55, 58, 58, 58, 59, 66, 66, 66, 66, 66, 66, 66, 69, 69, 69, 71, 71, 82, 82, 82, 82, 82, 82, 82, 82, 82, 82]