A242879 - cp's OEIS frontend

A242879 Least positive integer k < n such that kp == 1 (mod prime(k)) for some prime p < prime(k) and (n-k)q == 1 (mod prime(n-k)) for some prime q < prime(n-k), or 0 if such a number k does not exist.

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

[0, 0, 0, 2, 2, 2, 3, 2, 2, 3, 4, 2, 2, 3, 2, 3, 4, 7, 2, 2, 3, 4, 2, 3, 4, 13, 6, 7, 11, 13, 10, 11, 2, 3, 4, 18, 6, 7, 2, 3, 4, 2, 2, 3, 4, 6, 6, 2, 3, 2, 2, 3, 4, 2, 2, 3, 4, 6, 6, 2, 3, 2, 3, 4, 7, 2, 3, 2, 3, 4, 7, 2, 2, 2, 2, 3, 2, 3, 4, 7]

cp's OEIS Frontend

A242879 Least positive integer k < n such that kp == 1 (mod prime(k)) for some prime p < prime(k) and (n-k)q == 1 (mod prime(n-k)) for some prime q < prime(n-k), or 0 if such a number k does not exist.

Table of values

List of values

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

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

cp's OEIS Frontend

A242879 Least positive integer k < n such that k*p == 1 (mod prime(k)) for some prime p < prime(k) and (n-k)*q == 1 (mod prime(n-k)) for some prime q < prime(n-k), or 0 if such a number k does not exist.

Table of values

List of values

A242879 Least positive integer k < n such that kp == 1 (mod prime(k)) for some prime p < prime(k) and (n-k)q == 1 (mod prime(n-k)) for some prime q < prime(n-k), or 0 if such a number k does not exist.

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