id:A141843 - OEIS Search Results

Search: id:A141843

Displaying 1-1 of 1 results found.

page 1

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)).

+0
2

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, 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, 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 (list; table; graph; listen)

	OFFSET	`1,7`
	LINKS	`Colin S. Pearson, Table of n, a(n) for n = 1..1035` `Colin S. Pearson, CSP Queens - Counting Queen-placements` `Martin S. Pearson, Queens On A Chessboard` `Wikipedia, Eight Queens Puzzle`
	CROSSREFS	`Cf. A140450, A000170.` `Sequence in context: A131398 A050980 A053451 this_sequence A130266 A117137 A002344` `Adjacent sequences: A141840 A141841 A141842 this_sequence A141844 A141845 A141846`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Colin S. Pearson, Jul 10 2008, Aug 16 2008`
	EXTENSIONS	`Edited by David Wasserman (dwasserm(AT)earthlink.net), Jul 28 2008`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research