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.

A255709 No three points (i,a(i)), (j,a(j)), (k,a(k)) are collinear and all values distinct, for n = 0,1,2,... the value of a(n) is chosen to be m or -m (in this order) for the smallest m>=0 satisfying the condition.

Table of values

n a(n)
0 0
1 1
2 -1
3 2
4 3
5 -2
6 -5
7 -3
8 4
9 -6
10 6
11 -7
12 -4
13 5
14 12
15 16
16 7
17 8
18 -10
19 -8
20 9
21 19
22 14
23 -12
24 -14
25 -9
26 21
27 10
28 -11
29 -15
30 17
31 15
32 -19
33 13
34 -22
35 -13
36 -16
37 -24
38 11
39 18
40 22
41 -18
42 25
43 23
44 -17
45 24
46 40
47 -21
48 -38
49 20
50 -29
51 36
52 -30
53 -20
54 32
55 -34
56 26
57 43
58 -23
59 37
60 -26
61 33

List of values

[0, 1, -1, 2, 3, -2, -5, -3, 4, -6, 6, -7, -4, 5, 12, 16, 7, 8, -10, -8, 9, 19, 14, -12, -14, -9, 21, 10, -11, -15, 17, 15, -19, 13, -22, -13, -16, -24, 11, 18, 22, -18, 25, 23, -17, 24, 40, -21, -38, 20, -29, 36, -30, -20, 32, -34, 26, 43, -23, 37, -26, 33]