The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293681 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 i < j < k, P(k) does not lie on the vector (P(i), P(j)), 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, and in case of a tie, minimize the angle t; a(n) = Y-coordinate of P(n). 2
 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, -1, 2, 3, 4, 4, 3, 1, 0, -1, -3, -4, -4, -3, -2, 0, 4, 5, 5, 4, 2, -1, -2, -3, 0, 0, -1, -3, -4, -5, -5, -4, -3, -1, -5, -6, -6, -5, -3, 0, 4, 5, 6, 6, 5, 3, -1, -2, -3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 COMMENTS See A293680 for the corresponding X-coordinates, and additional comments. LINKS Rémy Sigrist, Table of n, a(n) for n = 1..10000 Rémy Sigrist, PARI program for A293681 PROG (PARI) See Links section. CROSSREFS Cf. A293680. Sequence in context: A211272 A298600 A292470 * A293773 A071017 A112049 Adjacent sequences: A293678 A293679 A293680 * A293682 A293683 A293684 KEYWORD sign,look AUTHOR Rémy Sigrist, Oct 14 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 23 11:05 EDT 2023. Contains 365544 sequences. (Running on oeis4.)