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.

A002568 Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.

Table of values

n a(n)
1 1
2 4
3 1
4 16
5 16
6 120
7 8
8 728
9 92
10 8
11 2
12 840
13 24
14 436
15 10188
16 128
17 12
18 224
19 8424
20 312
21 72
22 192
23 8784
24 368
25 56
26 224
27 14500
28 280
29 10880
30 240

List of values

[1, 4, 1, 16, 16, 120, 8, 728, 92, 8, 2, 840, 24, 436, 10188, 128, 12, 224, 8424, 312, 72, 192, 8784, 368, 56, 224, 14500, 280, 10880, 240]