function []=SuperKang(n)
  S=1;
  U=[1 2];
  p=2;

  while p<n do
    A=U(p)+S;
    k=2;
    test=0;
    while k<=p do
      d1=A-U(k);
      q=1;
      while q<k do
        d2=U(k)-U(q);
        if d1==d2 then
          k=p;
          q=k;
          test=1;
        else q=q+1;
        end
      end
      k=k+1;
    end
    if test==0 then
      p=p+1;
      S=1;
      U(p)=A;
    else S=S+1;
      k=2;
    end
  end
  disp(U)
endfunction


// En utilisant la fonction find de Scilab
function []=SuperKangBis(n)
  U=[1 2];
  while length(U)<n do
    p=1;
    long=length(U);
    A=U(long)+1;
    while (A<2*U(long)+U(1)-1) & (p<=long) do
      test=find(U==(A+U(p))/2);
      if length(test)>0 then
        A=A+1;
        p=1;
      else p=p+1;
      end
    end
    U(long+1)=A;
  end
  disp(U)
endfunction


SuperKang(100)