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.

A022462 a(n) = prime(n)*prime(n+2) mod prime(n+1).

Table of values

n a(n)
1 1
2 1
3 6
4 3
5 5
6 9
7 11
8 22
9 17
10 19
11 13
12 33
13 35
14 23
15 17
16 47
17 49
18 43
19 63
20 61
21 55
22 59
23 41
24 65
25 93
26 95
27 99
28 101
29 57
30 71
31 107
32 125
33 119
34 129
35 139
36 121
37 139
38 143
39 137
40 167
41 161
42 171
43 185
44 189
45 175
46 67
47 175
48 219
49 221
50 209
51 227
52 221
53 191
54 221
55 227
56 257
57 259
58 253
59 273
60 263

List of values

[1, 1, 6, 3, 5, 9, 11, 22, 17, 19, 13, 33, 35, 23, 17, 47, 49, 43, 63, 61, 55, 59, 41, 65, 93, 95, 99, 101, 57, 71, 107, 125, 119, 129, 139, 121, 139, 143, 137, 167, 161, 171, 185, 189, 175, 67, 175, 219, 221, 209, 227, 221, 191, 221, 227, 257, 259, 253, 273, 263]