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.

A294240 The number of possible ways in which 2*n^2 black pawns and 2*n^2 white pawns can be arranged on a 2n X 2n chessboard such that no pawn attacks another.

Table of values

n a(n)
0 1
1 3
2 30
3 410
4 6148
5 96120
6 1526700
7 24425026
8 392143828
9 6306613690
10 101505099104
11 1634209596410
12 26311180850268
13 423567557239604
14 6817440328754244
15 109703307312544664
16 1764863031686159684
17 28385338557467333804
18 456426743658724223028
19 7337464027218416593362

List of values

[1, 3, 30, 410, 6148, 96120, 1526700, 24425026, 392143828, 6306613690, 101505099104, 1634209596410, 26311180850268, 423567557239604, 6817440328754244, 109703307312544664, 1764863031686159684, 28385338557467333804, 456426743658724223028, 7337464027218416593362]