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.

A293539 Let P be the sequence of distinct lattice points defined by the following rules: P(1) = (0,0), P(2) = (1,0), and for any n > 2, P(n) is the closest lattice point to P(n-1) such that the angle of the vectors (P(n-2), P(n-1)) and (P(n-1), P(n)), say t, satisfies 0 < t <= Pi/2, and in case of a tie, minimize the angle t; a(n) = X-coordinate of P(n).

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.