A051853 - cp's OEIS frontend

A051853 Table of solutions to all possible Chinese Remainder Equations x = a1 mod p1, x = a2 mod p2, ..., x = an mod pn, where p1 - pn are the first n primes and each a1 - an varies between 1 and (its respective) p-1, with the leftmost a varying fastest.

n	a(n)
1	1
2	1
3	5
4	1
5	11
6	7
7	17
8	13
9	23
10	19
11	29
12	1
13	71
14	127
15	197
16	43
17	113
18	169
19	29
20	121
21	191
22	37
23	107
24	163
25	23
26	79
27	149
28	31
29	101
30	157
31	17
32	73
33	143
34	199
35	59
36	151
37	11
38	67
39	137
40	193
41	53
42	109
43	179
44	61
45	131
46	187
47	47
48	103
49	173
50	19
51	89
52	181
53	41
54	97
55	167
56	13
57	83
58	139
59	209
60	1
61	1541

[1, 1, 5, 1, 11, 7, 17, 13, 23, 19, 29, 1, 71, 127, 197, 43, 113, 169, 29, 121, 191, 37, 107, 163, 23, 79, 149, 31, 101, 157, 17, 73, 143, 199, 59, 151, 11, 67, 137, 193, 53, 109, 179, 61, 131, 187, 47, 103, 173, 19, 89, 181, 41, 97, 167, 13, 83, 139, 209, 1, 1541]

cp's OEIS Frontend

A051853 Table of solutions to all possible Chinese Remainder Equations x = a1 mod p1, x = a2 mod p2, ..., x = an mod pn, where p1 - pn are the first n primes and each a1 - an varies between 1 and (its respective) p-1, with the leftmost a varying fastest.

Table of values

List of values