|
%I #10 Mar 04 2015 19:45:15
%S 0,0,1,1,-1,-1,4,2,2,-3,-5,-2,-7,-2,5,3,3,-5,-4,-4,6,5,-6,-3,-10,11,
%T -6,4,18,11,19,7,12,12,6,-13,19,7,-10,-7,-9,-14,13,23,-28,-8,-14,9,8,
%U -22,-9,-8,23,-11,15,22,13,8,-21,-13,-26,9,-12,-12,-11,40,21
%N No three points (i,a(i)), (j,a(j)), (k,a(k)) are collinear, for n = 0,1,2,... the value of a(n) is chosen to be m or -m (in this order) for the smallest m>=0 satisfying the condition.
%H Alois P. Heinz, <a href="/A255708/b255708.txt">Table of n, a(n) for n = 0..20000</a>
%p a:= proc(n) option remember; local i, j, k, t, ok;
%p for t from 0 do for k in [t, -t] do ok:=true;
%p for j from n-1 to 1 by -1 while ok do
%p for i from j-1 to 0 by -1 while ok do
%p ok:= (n-j)*(a(j)-a(i))<>(j-i)*(k-a(j))
%p od od; if ok then return k fi
%p od od
%p end:
%p seq(a(n), n=0..60);
%Y Cf. A005836, A179040, A231334, A236266, A236335, A255709.
%K sign,look
%O 0,7
%A _Alois P. Heinz_, Mar 03 2015
|
