Search: id:A141843
Results 1-1 of 1 results found.
%I A141843
%S A141843 1,0,0,0,0,0,2,4,1,3,1,3,5,2,4,2,4,6,1,3,5,1,3,5,7,2,4,6,1,5,8,6,3,7,2,
%T A141843 4,1,3,6,8,2,4,9,7,5,1,3,6,8,10,5,9,2,4,7,1,3,5,7,9,11,2,4,6,8,10,1,3,
5,
%U A141843 8,10,12,6,11,2,7,9,4,1,3,5,2,9,12,10,13,4,6,8,11,7,1,3,5,7,12,10,13
%N A141843 Triangular array T(n,k) (n >= 1, 1 <= k <= n) read by rows: row n gives
the lexicographically first solution to the n queens problem, or
n zeros if no solution exists. The kth queen is placed in square
(k, T(n, k)).
%H A141843 Colin S. Pearson, Table of n, a(n) for n = 1..1035
a>
%H A141843 Colin S. Pearson, CSP Queens - Counting
Queen-placements
%H A141843 Martin S. Pearson, Queens On
A Chessboard
%H A141843 Wikipedia,
Eight Queens Puzzle
%Y A141843 Cf. A140450, A000170.
%Y A141843 Sequence in context: A131398 A050980 A053451 this_sequence A130266 A117137
A002344
%Y A141843 Adjacent sequences: A141840 A141841 A141842 this_sequence A141844 A141845
A141846
%K A141843 nonn,tabl
%O A141843 1,7
%A A141843 Colin S. Pearson, Jul 10 2008, Aug 16 2008
%E A141843 Edited by David Wasserman (dwasserm(AT)earthlink.net), Jul 28 2008
Search completed in 0.001 seconds