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.

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

Table of values

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

List of values

[0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 2, 1, 3, 0, 0, 0, 4, 0, 1, 2, 2, 3, 1, 4, 0, 0, 1, 0, 0, 0, 5, 3, 0, 7, 1, 0, 4, 2, 4, 2, 3, 5, 1, 1, 4, 1, 3, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 9, 2, 8, 10, 0, 4, 0, 0, 0, 2, 1, 7, 13, 4, 12, 4, 6, 7, 4, 4, 2, 0, 10, 2, 2, 1, 3, 1, 0, 0, 0, 12, 0, 9, 1, 0, 5, 2, 1, 17, 0, 3, 5, 0, 1, 1, 0, 0, 8, 3, 0, 0, 0, 15, 12, 9, 10, 11, 1, 5]