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.

A293730 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 at integer distance 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, and in case of a tie, maximize 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 -1
6 -1
7 2
8 2
9 -2
10 -2
11 1
12 0
13 0
14 1
15 1
16 0
17 0
18 1
19 1
20 0
21 4
22 4
23 3
24 3
25 5
26 5
27 2
28 2
29 6
30 6
31 3
32 4
33 4
34 3
35 3
36 4
37 4
38 3
39 3
40 4
41 7
42 6
43 6
44 7
45 7
46 3
47 3
48 4
49 4
50 2
51 2
52 5
53 5
54 2
55 5
56 5
57 4
58 8
59 8
60 7
61 7
62 9
63 9
64 6
65 10
66 10
67 9
68 9
69 11
70 11
71 8
72 8
73 12
74 12
75 9
76 10
77 10
78 9
79 9
80 10
81 10
82 9

List of values

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

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

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