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.

A386850 Least prime n < p <= (n-1)*(2n-1) such that Sum_{k=1..n} x^(n-k)/k! is irreducible modulo p, or 1 if such a prime p does not exist.

Table of values

n a(n)
1 1
2 3
3 7
4 7
5 13
6 41
7 13
8 31
9 29
10 31
11 37
12 23
13 97
14 331
15 53
16 101
17 47
18 89
19 43
20 199
21 53
22 43
23 47
24 107
25 83
26 61
27 149
28 37
29 353
30 127
31 113
32 199
33 173
34 107
35 67
36 401
37 349
38 101
39 347
40 47
41 79
42 89
43 83
44 241
45 139
46 641
47 673
48 103
49 491
50 179
51 383
52 293
53 61
54 439
55 397
56 547
57 79
58 1301
59 379
60 277

List of values

[1, 3, 7, 7, 13, 41, 13, 31, 29, 31, 37, 23, 97, 331, 53, 101, 47, 89, 43, 199, 53, 43, 47, 107, 83, 61, 149, 37, 353, 127, 113, 199, 173, 107, 67, 401, 349, 101, 347, 47, 79, 89, 83, 241, 139, 641, 673, 103, 491, 179, 383, 293, 61, 439, 397, 547, 79, 1301, 379, 277]