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.

A006076 Sequence A006075 gives minimal number of knights needed to cover an n X n board. This sequence gives number of inequivalent solutions using A006075(n) knights.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 8
6 23
7 3
8 1
9 1
10 2
11 100
12 1
13 20
14 1
15 63
16 1
17 29
18 2551

List of values

[1, 1, 2, 3, 8, 23, 3, 1, 1, 2, 100, 1, 20, 1, 63, 1, 29, 2551]