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.

A181206 T(n,k) = number of n X k matrices containing a permutation of 1..n*k moving each element at most to a neighboring position.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 9
6 3
7 5
8 32
9 32
10 5
11 8
12 121
13 229
14 121
15 8
16 13
17 450
18 1845
19 1845
20 450
21 13
22 21
23 1681
24 14320
25 32000
26 14320
27 1681
28 21
29 34
30 6272
31 112485
32 535229
33 535229
34 112485
35 6272
36 34
37 55
38 23409
39 880163
40 9049169
41 19114420
42 9049169
43 880163
44 23409
45 55
46 89
47 87362

List of values

[1, 2, 2, 3, 9, 3, 5, 32, 32, 5, 8, 121, 229, 121, 8, 13, 450, 1845, 1845, 450, 13, 21, 1681, 14320, 32000, 14320, 1681, 21, 34, 6272, 112485, 535229, 535229, 112485, 6272, 34, 55, 23409, 880163, 9049169, 19114420, 9049169, 880163, 23409, 55, 89, 87362]