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.

A002565 Number of non-isomorphic ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.

Table of values

n a(n)
1 0
2 2
3 5
4 3
5 15
6 150
7 5
8 56
9 3
10 39
11 681

List of values

[0, 2, 5, 3, 15, 150, 5, 56, 3, 39, 681]