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.

A074396 a(n) = 10 - (p mod 10), where p is the n-th prime congruent to 1 (mod 4) for which p+2 is also prime.

Table of values

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

List of values

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