%I #23 Apr 04 2024 10:56:52
%S 1,1,2,5,11,4,3,18,26,35,48,15,76,64,97,135,29,6,175,98,212,240,260,
%T 73,22,316,41,232,7,165,424,472,399,519,214,353,606,27,660,100,787,
%U 845,924,963,376,156,1095,766,356,621,1206,32,501,1292,1409,1169,1464
%N Lexicographically earliest sequence of positive integers such that the slope between any two points (i, a(i)) and (j, a(j)) is distinct.
%C a(1) = a(2) = 1 appears twice; it is the only term that can appear more than once.
%C From _Peter Kagey_, May 02 2017: (Start)
%C Sequence is bounded above by (n-1)*A000217(n-2)+1. - _Peter Kagey_, May 02 2017
%C Proof: The first n terms of the sequences have (1+2+...+(n-1)) = A000217(n-2) slopes, thus all of the lines starting at any of the first (n - 1) points with any of the already-present slopes can at most cross (n, 1), (n, 2), ... (n, (n-1*A000217(n-2)).
%C (End)
%H Peter Kagey and David A. Corneth, <a href="/A286091/b286091.txt">Table of n, a(n) for n = 1..1000 (first 600 terms from Peter Kagey)</a>
%H David A. Corneth, <a href="/A286091/a286091_1.gp.txt">PARI program</a>
%e a(3) != 1 otherwise the slope(a(1),a(2)) = slope(a(1),a(3)), therefore
%e a(3) = 2.
%e a(4) != 1 otherwise the slope(a(1),a(2)) = slope(a(1),a(4)),
%e a(4) != 2 otherwise the slope(a(1),a(2)) = slope(a(3),a(4)),
%e a(4) != 3 otherwise the slope(a(2),a(3)) = slope(a(3),a(4)),
%e a(4) != 4 otherwise the slope(a(2),a(3)) = slope(a(1),a(4)), therefore
%e a(4) = 5.
%p A[1]:= 1:
%p Slopes:= {}:
%p for n from 2 to 100 do
%p for k from 1 do
%p Sk:= {seq((k-A[i])/(n-i),i=1..n-1)};
%p if Sk intersect Slopes = {} then
%p A[n]:= k; Slopes:= Slopes union Sk; break
%p fi
%p od od:
%p seq(A[n],n=1..100); # _Robert Israel_, May 01 2017
%o (PARI) \\ See link "PARI program". _David A. Corneth_, May 05 2017
%Y Cf. A236335.
%K nonn
%O 1,3
%A _Peter Kagey_, May 01 2017