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.
%I A260319 #23 Mar 25 2022 23:17:01 %S A260319 0,0,0,0,0,1,2,1,4,3,12,18,32,105,310,734,2006,4526,11046,36035,93740, %T A260319 312673,895310,2917938,8532332,28929567 %N A260319 Number of singly symmetric characteristic solutions to the n-queens problem. %C A260319 The problem of placing eight queens on a chessboard so that no one of them can take any other in a single move is a particular case of the more general problem: On a square array of n X n cells place n objects, one on each of n different cells, in such a way that no two of them lie on the same row, column, or diagonal. %C A260319 There are no centrosymmetric solutions for n < 6, if by "centrosymmetric" we exclude "doubly symmetric" cases; and there is just one complete set for n = 6: 246135, 362514, 415263, 531642. %C A260319 On the ordinary chessboard of 8 X 8 cells there are a total of 92 solutions, consisting of 11 sets of equivalent ordinary solutions and one set of equivalent symmetric solutions. There are no doubly symmetric solutions in this case. These sets may be generated in the ordinary case by 15863724, 16837425, 24683175, 2571384, 25741863, 26174835, 26831475, 27368514, 27581463, 35841726, 36258174 and in the symmetric case by 35281746. %D A260319 Maurice Kraitchik: Mathematical Recreations. Mineola, NY: Dover, 2nd ed. 1953, p. 247-255 (The Problem of the Queens). %H A260319 P. Capstick and K. McCann, <a href="/A000170/a000170_1.pdf">The problem of the n queens</a>, apparently unpublished, no date (circa 1990?) [Scanned copy] %H A260319 M. A. Sainte-Laguë, <a href="https://eudml.org/doc/192551">Les Réseaux (ou Graphes)</a>, Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 47. %H A260319 M. A. Sainte-Laguë, <a href="/A002560/a002560.pdf">Les Réseaux (ou Graphes)</a>, Mémorial des Sciences Mathématiques, Fasc. 18, Gauthier-Villars, Paris, 1923, 64 pages. See p. 47. [Incomplete annotated scan of title page and pages 18-51] %F A260319 a(n) = -A000170(n)/4 + 2*A002562(n) - 3*A260318(n)/2, n > 1. - _R. J. Mathar_, Jul 24 2015 %Y A260319 A002562 = A260318 + A260319 + A260320, A000170 = 2*A260318 + 4*A260319 + 8*A260320 (n>1). %K A260319 nonn,more %O A260319 1,7 %A A260319 _N. J. A. Sloane_, Jul 22 2015 %E A260319 Name edited (by inserting "singly", since "doubly symmetric" solutions are symmetric but not counted here) by _Don Knuth_, Mar 25 2022