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.

A074879 10 - Mod(prime(n),10) when prime(n) + 22 = prime(n+1).

Table of values

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

List of values

[1, 9, 9, 3, 1, 1, 1, 3, 3, 1, 3, 1, 3, 1, 1, 3, 1, 9, 1, 3, 1, 3, 1, 9, 1, 3, 9, 3, 9, 3, 3, 1, 9, 3, 1, 1, 3, 9, 9, 3, 3, 1, 1, 3, 9, 9, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 9, 9, 1, 1, 9, 3, 1, 9, 1, 3, 1, 1, 9, 1, 1, 1, 3, 1, 3, 9, 9, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 1, 9, 9, 1, 3, 9, 1, 3, 1, 9, 3, 1, 9, 9, 9, 1, 1, 1]