cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A275899 Following the successive antidiagonals in A065188, let the n-th queen appear in square (x(n),y(n)); sequence gives x(n).

This page as a plain text file.
%I A275899 #14 Aug 25 2016 23:06:23
%S A275899 1,2,4,3,5,6,10,7,11,13,8,9,15,12,20,21,14,16,26,17,27,29,18,19,31,34,
%T A275899 22,23,38,24,40,25,43,42,28,30,49,50,32,33,54,56,35,36,59,58,37,39,64,
%U A275899 41,67,69,44,71,45,46,75,47,77,48,78,80,51,52,85,53,86,55,90,91,57,95,60,61,99,62,101,63
%N A275899 Following the successive antidiagonals in A065188, let the n-th queen appear in square (x(n),y(n)); sequence gives x(n).
%C A275899 See A275900 for y(n).
%C A275899 This is a permutation of the natural numbers.
%C A275899 This assumes the indexing starts at 1. See A275901, A275902 if the indexing begins at 0.
%H A275899 N. J. A. Sloane, <a href="/A275899/b275899.txt">Table of n, a(n) for n = 1..7500</a>
%p A275899 # To get the coordinates of queens in order of appearance; b8[] has list of terms of A065188
%p A275899 M:=7500; c1:=[]; c2:=[];
%p A275899 t1:=[seq(n+b8[n],n=1..M)];
%p A275899 t2:=sort(t1);
%p A275899 for n from 1 to M do
%p A275899 i:=t2[n]; member(i,t1,'j');
%p A275899 c1:=[op(c1),j]; c2:=[op(c2),b8[j]];
%p A275899 od:
%p A275899 c3:=map(x->x-1,c1):
%p A275899 c4:=map(x->x-1,c2):
%p A275899 [seq(c1[n],n=1..80)]; # A275899
%p A275899 [seq(c2[n],n=1..80)]; # A275900
%p A275899 [seq(c3[n],n=1..80)]; @ A275901
%p A275899 [seq(c4[n],n=1..80)]; @ A275902
%Y A275899 Cf. A065188, A275900, A275901, A275902.
%K A275899 nonn
%O A275899 1,2
%A A275899 _N. J. A. Sloane_, Aug 24 2016