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.

A277915 A(n,k) is the n-th number m such that a nontrivial prime(k)-th root of unity modulo m exists; square array A(n,k), n>=1, k>=1, read by antidiagonals.

Table of values

n a(n)
1 8
2 7
3 12
4 11
5 9
6 15
7 29
8 22
9 13
10 16
11 23
12 43
13 25
14 14
15 20
16 53
17 46
18 49
19 31
20 18
21 21
22 103
23 79
24 67
25 58
26 33
27 19
28 24
29 191
30 137
31 106
32 69
33 71
34 41
35 21
36 28
37 47
38 229
39 206
40 131
41 89
42 86
43 44
44 26
45 30
46 59
47 94
48 361
49 239
50 157
51 92
52 87
53 50
54 27
55 32
56 311
57 118
58 139
59 382
60 274
61 158
62 115
63 98
64 55
65 28
66 33

List of values

[8, 7, 12, 11, 9, 15, 29, 22, 13, 16, 23, 43, 25, 14, 20, 53, 46, 49, 31, 18, 21, 103, 79, 67, 58, 33, 19, 24, 191, 137, 106, 69, 71, 41, 21, 28, 47, 229, 206, 131, 89, 86, 44, 26, 30, 59, 94, 361, 239, 157, 92, 87, 50, 27, 32, 311, 118, 139, 382, 274, 158, 115, 98, 55, 28, 33]