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.

A335617 Let c(1) = c(2) = 0, c(3) = 1, and c(n + 3) = (c(n) - 2*c(n + 1) + c(n + 2))/n, then a(n) = ceiling (c(n)).

Table of values

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

List of values

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