A194943 - cp's OEIS frontend

A194943 Greatest d such that dn+b is the least prime in the arithmetic progression kn+b for some 0 < b < n with gcd(b, n) = 1.

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

[1, 2, 1, 3, 1, 4, 2, 4, 1, 6, 1, 7, 3, 2, 2, 6, 2, 10, 2, 4, 3, 10, 3, 10, 3, 6, 2, 10, 2, 18, 4, 6, 5, 6, 4, 11, 5, 5, 3, 14, 2, 10, 5, 8, 6, 20, 3, 12, 5, 8, 11, 12, 3, 6, 4, 7, 5, 12, 2, 24, 9, 6, 5, 6, 3, 15, 5, 8, 3, 18, 4, 24, 8, 8, 6, 10]

cp's OEIS Frontend

A194943 Greatest d such that dn+b is the least prime in the arithmetic progression kn+b for some 0 < b < n with gcd(b, n) = 1.

Table of values

List of values

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

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

cp's OEIS Frontend

A194943 Greatest d such that d*n+b is the least prime in the arithmetic progression k*n+b for some 0 < b < n with gcd(b, n) = 1.

Table of values

List of values

A194943 Greatest d such that dn+b is the least prime in the arithmetic progression kn+b for some 0 < b < n with gcd(b, n) = 1.

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