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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 2
7 3
8 16
9 52
10 286
11 1403
12 8214
13 54756
14 389833
15 2923757
16 22932960
17 184339572

List of values

[0, 0, 0, 0, 0, 2, 3, 16, 52, 286, 1403, 8214, 54756, 389833, 2923757, 22932960, 184339572]