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.

A090051 Number of chess diagrams that can be obtained in exactly one way in n plies. This is also the number of dual-free proof games in n plies.

Table of values

n a(n)
0 1
1 20
2 400
3 1862
4 9373
5 51323
6 298821
7 1965313
8 11759158
9 66434263
10 365037821
11 1895313862

List of values

[1, 20, 400, 1862, 9373, 51323, 298821, 1965313, 11759158, 66434263, 365037821, 1895313862]