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.

A189280 T(n,k) = number of n X k array permutations with each element not moved or moved diagonally or antidiagonally by one.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 4
6 1
7 1
8 9
9 9
10 1
11 1
12 25
13 45
14 25
15 1
16 1
17 64
18 225
19 225
20 64
21 1
22 1
23 169
24 1125
25 2704
26 1125
27 169
28 1
29 1
30 441
31 5625
32 29241
33 29241
34 5625
35 441
36 1
37 1
38 1156
39 28125
40 323761
41 670480
42 323761
43 28125
44 1156
45 1
46 1
47 3025
48 140625
49 3553225
50 15594601
51 15594601
52 3553225

List of values

[1, 1, 1, 1, 4, 1, 1, 9, 9, 1, 1, 25, 45, 25, 1, 1, 64, 225, 225, 64, 1, 1, 169, 1125, 2704, 1125, 169, 1, 1, 441, 5625, 29241, 29241, 5625, 441, 1, 1, 1156, 28125, 323761, 670480, 323761, 28125, 1156, 1, 1, 3025, 140625, 3553225, 15594601, 15594601, 3553225]