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.

A216800 T(n,k)=Number of permutations of an nXk array with each element moving exactly one horizontally or vertically and without 2-loops.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 2
6 0
7 0
8 2
9 2
10 0
11 0
12 6
13 0
14 6
15 0
16 0
17 10
18 8
19 8
20 10
21 0
22 0
23 22
24 0
25 88
26 0
27 22
28 0
29 0
30 42
31 32
32 292
33 292
34 32
35 42
36 0
37 0
38 86
39 0
40 1774
41 0
42 1774
43 0
44 86
45 0
46 0
47 170
48 128
49 7676
50 10140
51 10140
52 7676
53 128
54 170
55 0
56 0
57 342
58 0
59 39844
60 0
61 207408
62 0
63 39844
64 0
65 342
66 0
67 0
68 682
69 512
70 186996

List of values

[0, 0, 0, 0, 2, 0, 0, 2, 2, 0, 0, 6, 0, 6, 0, 0, 10, 8, 8, 10, 0, 0, 22, 0, 88, 0, 22, 0, 0, 42, 32, 292, 292, 32, 42, 0, 0, 86, 0, 1774, 0, 1774, 0, 86, 0, 0, 170, 128, 7676, 10140, 10140, 7676, 128, 170, 0, 0, 342, 0, 39844, 0, 207408, 0, 39844, 0, 342, 0, 0, 682, 512, 186996]