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.

A305828 The n-th number m such that a nontrivial prime(n)-th root of unity modulo m exists.

Table of values

n a(n)
1 8
2 9
3 25
4 58
5 89
6 158
7 307
8 571
9 282
10 466
11 1303
12 1043
13 913
14 1384
15 1977
16 1486
17 3308
18 2936
19 3497
20 3983
21 2930
22 4426
23 2338
24 3401
25 4668
26 6070
27 6186
28 6430
29 10910
30 4994
31 9671
32 4997
33 9053
34 10583
35 13123
36 10874
37 22611
38 14366
39 30066
40 8328
41 10031
42 15206
43 11873
44 17006

List of values

[8, 9, 25, 58, 89, 158, 307, 571, 282, 466, 1303, 1043, 913, 1384, 1977, 1486, 3308, 2936, 3497, 3983, 2930, 4426, 2338, 3401, 4668, 6070, 6186, 6430, 10910, 4994, 9671, 4997, 9053, 10583, 13123, 10874, 22611, 14366, 30066, 8328, 10031, 15206, 11873, 17006]