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.

A293540 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) = Y-coordinate of P(n).

Table of values

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

List of values

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

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

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