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.

A276206 a(0) = a(1) = a(2) = a(3) = 0. For n>3 a(n) is the smallest nonnegative integer such that there is no arithmetic progression i,j,k,m,n (of length 5) such that a(i)+a(j)+a(k)+a(m) = a(n).

Table of values

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

List of values

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