A393932 Start with a point at (0,0). At each iteration, add a new point by going one step up or to the right from the current point, choosing the option that gives the least maximum number of points on a line through the new point. In case of ties, compare the number of points on the line with the next largest number of points, etc. If there is still a tie, go to the right. a(n) is 0 if the n-th step is to the right, 1 if the step is upwards.

0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0

Offset

1

Comments

Ties appear (in the sense that both candidate points have the same multiset of numbers of points on all lines through the candidate point) when the 2nd, 5th, and 18th points are added (corresponding to a(1), a(4), and a(17), respectively).

Links

Table of n, a(n) for n=1..87.

Pontus von Brömssen, The first 10000 points.

Crossrefs

Row 2 of A393934.

Cf. A393933 (3 dimensions), A393935.

Sequence in context: A284772 A051069 A051065 * A091445 A091446 A341256

Adjacent sequences: A393928 A393930 A393931 * A393933 A393934 A393935

Keyword

nonn

Author

Pontus von Brömssen, Mar 04 2026

Status

approved