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.

A189186 T(n,k) = Number of n X k array permutations with each element making a single king move.

Table of values

n a(n)
1 0
2 1
3 1
4 0
5 9
6 0
7 1
8 33
9 33
10 1
11 0
12 185
13 192
14 185
15 0
16 1
17 913
18 4081
19 4081
20 913
21 1
22 0
23 4777
24 47936
25 251720
26 47936
27 4777
28 0
29 1
30 24577
31 733465
32 10599449
33 10599449
34 733465
35 24577
36 1
37 0
38 127385
39 9925824
40 524539713
41 1339732352
42 524539713
43 9925824
44 127385
45 0
46 1

List of values

[0, 1, 1, 0, 9, 0, 1, 33, 33, 1, 0, 185, 192, 185, 0, 1, 913, 4081, 4081, 913, 1, 0, 4777, 47936, 251720, 47936, 4777, 0, 1, 24577, 733465, 10599449, 10599449, 733465, 24577, 1, 0, 127385, 9925824, 524539713, 1339732352, 524539713, 9925824, 127385, 0, 1]