|
%I #27 Nov 08 2016 20:08:54
%S 0,2,1,4,3,8,5,10,7,6,12,14,9,18,11,13,21,24,15,26,17,16,28,30,19,20,
%T 34,36,22,38,23,40,25,27,44,47,29,31,50,52,32,33,55,57,35,37,59,62,39,
%U 65,41,42,69,43,71,73,45,75,46,77,49,48,81,83,51,85,53,88,54,56,91,58,95,97,60,99,61,101
%N Following the successive antidiagonals in A275895, let the n-th queen appear in square (x(n),y(n)); sequence gives y(n).
%C See A275901 for x(n).
%C This is a permutation of the nonnegative numbers.
%C This assumes the indexing starts at 0. See A275899, A275900 if the indexing begins at 1.
%H N. J. A. Sloane, <a href="/A275902/b275902.txt">Table of n, a(n) for n = 0..10386</a>
%p See A275899.
%p # Alternative Maple program from _N. J. A. Sloane_, Oct 03 2016
%p # To get 10000 terms of A275902 (xx), A275901 (yy), A276783 (ss), -A276325 (dd)
%p M1:=100000; M2:=22000; M3:=10000;
%p xx:=Array(0..M1,0); yy:=Array(0..M1,0); ss:=Array(0..M1,0); dd:=Array(0..M1,0);
%p xx[0]:=0; yy[0]:=0; ss[0]:=0; dd[0]:=0;
%p for n from 1 to M2 do
%p sw:=-1;
%p for s from ss[n-1]+1 to M2 do
%p for i from 0 to s do
%p x:=s-i; y:=i;
%p if not member(x,xx,'p') and
%p not member(y,yy,'p') and
%p not member(x-y,dd,'p') then sw:=1; break; fi;
%p od: # od i
%p if sw=1 then break; fi;
%p od: # od s
%p if sw=-1 then lprint("error, n=",n); break; fi;
%p xx[n]:=x; yy[n]:=y; ss[n]:=x+y; dd[n]:=x-y;
%p od: # od n
%p [seq(xx[i],i=0..M3)]:
%p [seq(yy[i],i=0..M3)]:
%p [seq(ss[i],i=0..M3)]:
%p [seq(dd[i],i=0..M3)]:
%Y Cf. A065188, A275895, A275899, A275900, A275901.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Aug 24 2016
|
