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.

A293862 Sequence of signed integers where each is chosen to be as small as possible (in absolute value) subject to the condition that no three terms a(j), a(j+k), a(j+2k) (for any j and k) form an arithmetic progression; in case of a tie, preference is given to the positive value.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 1
7 1
8 -1
9 -1
10 0
11 0
12 -1
13 0
14 0
15 1
16 3
17 3
18 -1
19 3
20 3
21 1
22 1
23 2
24 2
25 1
26 -3
27 2
28 0
29 0
30 -2
31 0
32 0
33 1
34 -3
35 -3
36 -2
37 0
38 0
39 4
40 0
41 0
42 1
43 -2
44 -1
45 -1
46 -2
47 5
48 -1
49 3
50 -3
51 2
52 3
53 3
54 2
55 5
56 4
57 4
58 2
59 4
60 2
61 3
62 -1
63 -1
64 3
65 -8
66 -2
67 5
68 2
69 -2
70 -2
71 -8
72 -3
73 -2
74 -8
75 -6
76 -6
77 2
78 5

List of values

[0, 0, 1, 0, 0, 1, 1, -1, -1, 0, 0, -1, 0, 0, 1, 3, 3, -1, 3, 3, 1, 1, 2, 2, 1, -3, 2, 0, 0, -2, 0, 0, 1, -3, -3, -2, 0, 0, 4, 0, 0, 1, -2, -1, -1, -2, 5, -1, 3, -3, 2, 3, 3, 2, 5, 4, 4, 2, 4, 2, 3, -1, -1, 3, -8, -2, 5, 2, -2, -2, -8, -3, -2, -8, -6, -6, 2, 5]