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.

A049563 a(n) = ((prime(n)-1)! + 1) mod (prime(n) + 2).

Table of values

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

List of values

[2, 3, 4, 1, 7, 1, 10, 1, 1, 16, 1, 1, 22, 1, 1, 1, 31, 1, 1, 37, 1, 1, 1, 1, 1, 52, 1, 55, 1, 1, 1, 1, 70, 1, 76, 1, 1, 1, 1, 1, 91, 1, 97, 1, 100, 1, 1, 1, 115, 1, 1, 121, 1, 1, 1, 1, 136, 1, 1, 142, 1, 1, 1, 157, 1, 1, 1, 1, 175, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 211, 1, 217, 1, 1, 1, 1, 1]