cp's OEIS Frontend

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.

A129554 Number of ways to place n+3 queens and 3 pawns on an n X n board so that no two queens attack each other (symmetric solutions count only once).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 6, 66, 751, 9737, 131672, 1708295
Offset: 1

Views

Author

R. Douglas Chatham (d.chatham(AT)moreheadstate.edu), Apr 20 2007

Keywords

Examples

			a(4)=0 because when 7 queens are placed on a 4 X 4 board, at least two queens will be adjacent and therefore mutually attacking.
		

Crossrefs