VOOZH about

URL: https://oeis.org/history?seq=A129552

⇱ The On-Line Encyclopedia of Integer Sequences (OEIS)

login

Showing all changes.
Number of ways to place n+2 queens and 2 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once).
#7 by Bruno Berselli at Sun May 26 15:13:49 EDT 2013
STATUS
#6 by James Sellers at Sun May 26 15:11:46 EDT 2013
STATUS
#5 by James Sellers at Sun May 26 15:11:40 EDT 2013
STATUS
#4 by James Sellers at Sun May 26 15:11:35 EDT 2013
LINKS
STATUS
#3 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008
EXAMPLE
KEYWORD
#2 by N. J. A. Sloane at Sun Dec 09 03:00:00 EST 2007
CROSSREFS
KEYWORD
#1 by N. J. A. Sloane at Fri May 11 03:00:00 EDT 2007
NAME
DATA
OFFSET
LINKS
EXAMPLE
CROSSREFS
KEYWORD
AUTHOR
STATUS