|
%I #13 Sep 22 2017 04:44:53
%S 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,
%T 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,
%U 4,5,6,6,5,4,2,-1,-5,-6,-7,-7,-6,-4,-1,3,4,5,6
%N 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).
%C See A292469 for the X-coordinate of P(n), and additional comments.
%H Rémy Sigrist, <a href="/A292470/b292470.txt">Table of n, a(n) for n = 1..1000</a>
%H Rémy Sigrist, <a href="/A292470/a292470.txt">C++ program for A292470</a>
%o (C++) See Links section.
%Y Cf. A292469.
%K sign,look
%O 1,10
%A _Rémy Sigrist_, Sep 17 2017
|
