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.

A244738 a(n) = (prime(n) mod 5) mod 3.

Table of values

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

List of values

[2, 0, 0, 2, 1, 0, 2, 1, 0, 1, 1, 2, 1, 0, 2, 0, 1, 1, 2, 1, 0, 1, 0, 1, 2, 1, 0, 2, 1, 0, 2, 1, 2, 1, 1, 1, 2, 0, 2, 0, 1, 1, 1, 0, 2, 1, 1, 0, 2, 1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 0, 0, 2, 1, 0, 2, 1, 2, 2, 1, 0, 1, 2, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 0]