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.

A292469 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 Z-coordinate of the cross product of the vectors (P(n-1), P(n)) and (P(n-1), P(j)) is strictly negative for j=1..n-2, 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) = 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 4
18 4
19 3
20 2
21 -1
22 -2
23 -3
24 -3
25 -2
26 -1
27 1
28 4
29 5
30 5
31 4
32 2
33 1
34 -1
35 -2
36 -3
37 -4
38 -4
39 -3
40 0
41 2
42 5
43 6
44 6
45 5
46 3
47 0
48 -1
49 -2
50 -3
51 -4
52 -5
53 -5
54 -4
55 -2
56 1
57 8
58 8
59 7
60 5
61 2
62 1
63 -2
64 -3
65 -4
66 -5
67 -6
68 -6
69 -5
70 -4
71 -2
72 1
73 5
74 10
75 10

List of values

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

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

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