A222114 - cp's OEIS frontend

A222114 Least integer m>1 such that 6p_k(p_k-1) (k=1,...,n) are pairwise incongruent modulo m, where p_k denotes the k-th prime.

n	a(n)
1	2
2	5
3	5
4	13
5	19
6	29
7	31
8	37
9	37
10	37
11	61
12	61
13	61
14	89
15	97
16	97
17	97
18	109
19	131
20	139
21	149
22	157
23	157
24	157
25	173
26	181
27	193
28	193
29	193
30	193
31	241
32	241
33	241
34	271
35	271
36	271
37	271
38	317
39	331
40	331
41	331
42	349
43	349
44	367
45	367
46	367
47	397
48	397
49	397
50	397
51	397
52	397
53	457
54	457
55	457
56	457
57	457
58	457
59	523
60	523

[2, 5, 5, 13, 19, 29, 31, 37, 37, 37, 61, 61, 61, 89, 97, 97, 97, 109, 131, 139, 149, 157, 157, 157, 173, 181, 193, 193, 193, 193, 241, 241, 241, 271, 271, 271, 271, 317, 331, 331, 331, 349, 349, 367, 367, 367, 397, 397, 397, 397, 397, 397, 457, 457, 457, 457, 457, 457, 523, 523]

cp's OEIS Frontend

A222114 Least integer m>1 such that 6p_k(p_k-1) (k=1,...,n) are pairwise incongruent modulo m, where p_k denotes the k-th prime.

Table of values

List of values

n	a(n)
1	2
2	5
3	5
4	13
5	19
6	29
7	31
8	37
9	37
10	37
11	61
12	61
13	61
14	89
15	97
16	97
17	97
18	109
19	131
20	139
21	149
22	157
23	157
24	157
25	173
26	181
27	193
28	193
29	193
30	193
31	241
32	241
33	241
34	271
35	271
36	271
37	271
38	317
39	331
40	331
41	331
42	349
43	349
44	367
45	367
46	367
47	397
48	397
49	397
50	397
51	397
52	397
53	457
54	457
55	457
56	457
57	457
58	457
59	523
60	523

n	a(n)
1	2
2	5
3	5
4	13
5	19
6	29
7	31
8	37
9	37
10	37
11	61
12	61
13	61
14	89
15	97
16	97
17	97
18	109
19	131
20	139
21	149
22	157
23	157
24	157
25	173
26	181
27	193
28	193
29	193
30	193
31	241
32	241
33	241
34	271
35	271
36	271
37	271
38	317
39	331
40	331
41	331
42	349
43	349
44	367
45	367
46	367
47	397
48	397
49	397
50	397
51	397
52	397
53	457
54	457
55	457
56	457
57	457
58	457
59	523
60	523

cp's OEIS Frontend

A222114 Least integer m>1 such that 6*p_k*(p_k-1) (k=1,...,n) are pairwise incongruent modulo m, where p_k denotes the k-th prime.

Table of values

List of values

A222114 Least integer m>1 such that 6p_k(p_k-1) (k=1,...,n) are pairwise incongruent modulo m, where p_k denotes the k-th prime.

n	a(n)
1	2
2	5
3	5
4	13
5	19
6	29
7	31
8	37
9	37
10	37
11	61
12	61
13	61
14	89
15	97
16	97
17	97
18	109
19	131
20	139
21	149
22	157
23	157
24	157
25	173
26	181
27	193
28	193
29	193
30	193
31	241
32	241
33	241
34	271
35	271
36	271
37	271
38	317
39	331
40	331
41	331
42	349
43	349
44	367
45	367
46	367
47	397
48	397
49	397
50	397
51	397
52	397
53	457
54	457
55	457
56	457
57	457
58	457
59	523
60	523