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.

A292470 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 P(n) is a vertex of the convex hull of the set of points {P(1), ..., P(n)}, and in case of a tie, P(n) maximizes the dot product of the vectors (P(n-2), P(n-1)) and (P(n-1), P(n)); 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 3
20 3
21 2
22 1
23 -1
24 -2
25 -3
26 -3
27 -2
28 0
29 1
30 2
31 3
32 4
33 4
34 3
35 2
36 0
37 -3
38 -4
39 -4
40 -3
41 -2
42 0
43 1
44 2
45 3
46 4
47 5
48 5
49 4
50 2
51 -1
52 -5
53 -6
54 -6
55 -5
56 -3
57 2
58 3
59 4
60 5
61 6
62 6
63 5
64 4
65 2
66 -1
67 -5
68 -6
69 -7
70 -7
71 -6
72 -4
73 -1
74 3
75 4
76 5
77 6

List of values

[0, 0, 1, 1, 0, -1, -1, 0, 1, 2, 2, 1, -1, -2, -2, -1, 1, 2, 3, 3, 2, 1, -1, -2, -3, -3, -2, 0, 1, 2, 3, 4, 4, 3, 2, 0, -3, -4, -4, -3, -2, 0, 1, 2, 3, 4, 5, 5, 4, 2, -1, -5, -6, -6, -5, -3, 2, 3, 4, 5, 6, 6, 5, 4, 2, -1, -5, -6, -7, -7, -6, -4, -1, 3, 4, 5, 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.