46942156800domain: NAppears in sequencesBishops on an n X n board (see Robinson paper for details).at n=26A122748a(n) = Sum (J(p): p is a permutation of {1,2,...,n}), where J(p) is the number of j <= ceiling(n/2) such that p(j) + p(n+1-j) = n+1.at n=13A155519Compositorial(n) mod n!, that is, A036691(n) mod A000142(n).at n=13A233448