cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A051854 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 rightmost a (an) varying fastest.

Table of values

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

List of values

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