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.

A180217 a(n) = (n-th prime modulo 3) + (n-th prime modulo 4).

Table of values

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

List of values

[4, 3, 3, 4, 5, 2, 3, 4, 5, 3, 4, 2, 3, 4, 5, 3, 5, 2, 4, 5, 2, 4, 5, 3, 2, 3, 4, 5, 2, 3, 4, 5, 3, 4, 3, 4, 2, 4, 5, 3, 5, 2, 5, 2, 3, 4, 4, 4, 5, 2, 3, 5, 2, 5, 3, 5, 3, 4, 2, 3, 4, 3, 4, 5, 2, 3, 4, 2, 5, 2, 3, 5, 4, 2, 4, 5, 3, 2, 3, 2, 5, 2, 5, 2, 4, 5, 3, 2, 3, 4, 5, 5, 4, 5, 4, 5, 3, 3, 4, 2, 4, 3]