A210642 - cp's OEIS frontend

A210642 a(n) = least integer m > 1 such that k! == n! (mod m) for no 0 < k < n.

n	a(n)
1	2
2	2
3	3
4	4
5	5
6	9
7	7
8	13
9	17
10	17
11	11
12	13
13	13
14	19
15	23
16	17
17	17
18	29
19	19
20	23
21	31
22	31
23	23
24	41
25	31
26	29
27	31
28	37
29	29
30	31
31	31
32	37
33	41
34	41
35	59
36	37
37	37
38	59
39	43
40	41
41	41
42	59
43	43
44	67
45	53
46	53
47	47
48	53
49	67
50	59
51	61
52	53
53	53
54	79
55	59
56	59
57	67
58	73
59	59
60	67

[2, 2, 3, 4, 5, 9, 7, 13, 17, 17, 11, 13, 13, 19, 23, 17, 17, 29, 19, 23, 31, 31, 23, 41, 31, 29, 31, 37, 29, 31, 31, 37, 41, 41, 59, 37, 37, 59, 43, 41, 41, 59, 43, 67, 53, 53, 47, 53, 67, 59, 61, 53, 53, 79, 59, 59, 67, 73, 59, 67]

cp's OEIS Frontend

A210642 a(n) = least integer m > 1 such that k! == n! (mod m) for no 0 < k < n.

Table of values

List of values

n	a(n)
1	2
2	2
3	3
4	4
5	5
6	9
7	7
8	13
9	17
10	17
11	11
12	13
13	13
14	19
15	23
16	17
17	17
18	29
19	19
20	23
21	31
22	31
23	23
24	41
25	31
26	29
27	31
28	37
29	29
30	31
31	31
32	37
33	41
34	41
35	59
36	37
37	37
38	59
39	43
40	41
41	41
42	59
43	43
44	67
45	53
46	53
47	47
48	53
49	67
50	59
51	61
52	53
53	53
54	79
55	59
56	59
57	67
58	73
59	59
60	67

n	a(n)
1	2
2	2
3	3
4	4
5	5
6	9
7	7
8	13
9	17
10	17
11	11
12	13
13	13
14	19
15	23
16	17
17	17
18	29
19	19
20	23
21	31
22	31
23	23
24	41
25	31
26	29
27	31
28	37
29	29
30	31
31	31
32	37
33	41
34	41
35	59
36	37
37	37
38	59
39	43
40	41
41	41
42	59
43	43
44	67
45	53
46	53
47	47
48	53
49	67
50	59
51	61
52	53
53	53
54	79
55	59
56	59
57	67
58	73
59	59
60	67

n	a(n)
1	2
2	2
3	3
4	4
5	5
6	9
7	7
8	13
9	17
10	17
11	11
12	13
13	13
14	19
15	23
16	17
17	17
18	29
19	19
20	23
21	31
22	31
23	23
24	41
25	31
26	29
27	31
28	37
29	29
30	31
31	31
32	37
33	41
34	41
35	59
36	37
37	37
38	59
39	43
40	41
41	41
42	59
43	43
44	67
45	53
46	53
47	47
48	53
49	67
50	59
51	61
52	53
53	53
54	79
55	59
56	59
57	67
58	73
59	59
60	67