A385678 - cp's OEIS frontend

A385678 Least prime p <= n^2 - 2n + 4 such that the polynomial Sum_{k=1..n} phi(k)x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where phi is Euler's totient function given by A000010.

n	a(n)
1	1
2	2
3	3
4	1
5	1
6	7
7	31
8	13
9	67
10	7
11	67
12	13
13	53
14	7
15	11
16	19
17	101
18	239
19	37
20	23
21	13
22	103
23	263
24	89
25	79
26	29
27	47
28	23
29	167
30	317
31	139
32	73
33	283
34	7
35	223
36	71
37	83
38	29
39	1117
40	503
41	83
42	167
43	811
44	349
45	17
46	3
47	263
48	37
49	157
50	317
51	11
52	7
53	43
54	283
55	17
56	79
57	193
58	293
59	257
60	233

[1, 2, 3, 1, 1, 7, 31, 13, 67, 7, 67, 13, 53, 7, 11, 19, 101, 239, 37, 23, 13, 103, 263, 89, 79, 29, 47, 23, 167, 317, 139, 73, 283, 7, 223, 71, 83, 29, 1117, 503, 83, 167, 811, 349, 17, 3, 263, 37, 157, 317, 11, 7, 43, 283, 17, 79, 193, 293, 257, 233]

cp's OEIS Frontend

A385678 Least prime p <= n^2 - 2n + 4 such that the polynomial Sum_{k=1..n} phi(k)x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where phi is Euler's totient function given by A000010.

Table of values

List of values

cp's OEIS Frontend

A385678 Least prime p <= n^2 - 2*n + 4 such that the polynomial Sum_{k=1..n} phi(k)*x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where phi is Euler's totient function given by A000010.

Table of values

List of values

A385678 Least prime p <= n^2 - 2n + 4 such that the polynomial Sum_{k=1..n} phi(k)x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where phi is Euler's totient function given by A000010.