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.

A106728 Triangle T(n, k) = ( ((f(n+1) mod 5) mod 4) + ((f(k+1) mod 5) mod 4) ) mod 4, where f(n) = 10 - (prime(n+3) mod 10).

Table of values

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

List of values

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