A386827 - cp's OEIS frontend

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

n	a(n)
1	1
2	3
3	7
4	13
5	7
6	11
7	83
8	11
9	43
10	103
11	41
12	29
13	89
14	67
15	43
16	23
17	41
18	67
19	131
20	269
21	47
22	151
23	43
24	149
25	191
26	127
27	29
28	113
29	263
30	173
31	61
32	463
33	223
34	67
35	61
36	127
37	103
38	97
39	47
40	271
41	89
42	59
43	337
44	281
45	157
46	541
47	269
48	277
49	73
50	337
51	463
52	379
53	223
54	1481
55	827
56	797
57	397
58	101
59	337
60	431

[1, 3, 7, 13, 7, 11, 83, 11, 43, 103, 41, 29, 89, 67, 43, 23, 41, 67, 131, 269, 47, 151, 43, 149, 191, 127, 29, 113, 263, 173, 61, 463, 223, 67, 61, 127, 103, 97, 47, 271, 89, 59, 337, 281, 157, 541, 269, 277, 73, 337, 463, 379, 223, 1481, 827, 797, 397, 101, 337, 431]

cp's OEIS Frontend

A386827 Least prime n < p < 2n(n-1) such that the polynomial 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

List of values

cp's OEIS Frontend

A386827 Least prime n < p < 2*n*(n-1) such that the polynomial 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

List of values

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