A385658 - cp's OEIS frontend

A385658 Least prime p < 2n(n+1) such that the polynomial Sum_{k=1..n} tau(k)x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where tau is Ramanujan's tau function given by A000594.

n	a(n)
1	1
2	2
3	5
4	17
5	59
6	19
7	43
8	17
9	19
10	89
11	47
12	67
13	257
14	89
15	173
16	11
17	103
18	67
19	103
20	191
21	29
22	89
23	101
24	139
25	19
26	13
27	19
28	79
29	79
30	271
31	223
32	149
33	131
34	5
35	37
36	31
37	593
38	149
39	353
40	109
41	293
42	293
43	17
44	19
45	97
46	83
47	59
48	79
49	883
50	101
51	71
52	13
53	199
54	113
55	1013
56	29
57	1279
58	7
59	181
60	383
61	269
62	197
63	17

[1, 2, 5, 17, 59, 19, 43, 17, 19, 89, 47, 67, 257, 89, 173, 11, 103, 67, 103, 191, 29, 89, 101, 139, 19, 13, 19, 79, 79, 271, 223, 149, 131, 5, 37, 31, 593, 149, 353, 109, 293, 293, 17, 19, 97, 83, 59, 79, 883, 101, 71, 13, 199, 113, 1013, 29, 1279, 7, 181, 383, 269, 197, 17]

cp's OEIS Frontend

A385658 Least prime p < 2n(n+1) such that the polynomial Sum_{k=1..n} tau(k)x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where tau is Ramanujan's tau function given by A000594.

Table of values

List of values

cp's OEIS Frontend

A385658 Least prime p < 2n*(n+1) such that the polynomial Sum_{k=1..n} tau(k)*x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where tau is Ramanujan's tau function given by A000594.

Table of values

List of values

A385658 Least prime p < 2n(n+1) such that the polynomial Sum_{k=1..n} tau(k)x^(n-k) is irreducible modulo p, or 1 if such p does not exist, where tau is Ramanujan's tau function given by A000594.