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.

A215293 Number of permutations of 0..floor((n*n-2)/2) on odd squares of an n X n array such that each row and column of odd squares is increasing.

Table of values

n a(n)
1 1
2 2
3 6
4 280
5 23100
6 85765680
7 577185873264
8 346915095471584640
9 381134230556959188429120
10 62144711688730139887005809020800
11 18592619468814454675301397184588597886400
12 1236552808693429892089668394551052130596983991526400
13 151213938214745201135492692441902799026853717717324113365952000

List of values

[1, 2, 6, 280, 23100, 85765680, 577185873264, 346915095471584640, 381134230556959188429120, 62144711688730139887005809020800, 18592619468814454675301397184588597886400, 1236552808693429892089668394551052130596983991526400, 151213938214745201135492692441902799026853717717324113365952000]