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.

A059318 Pascal's "rhombus" (actually a triangle) mod 2, read by rows: each entry is sum modulo 2 of 3 terms above it in previous row and one term above it two rows back.

Table of values

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

List of values

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