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.

A263905 T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and the total absolute value of displacements not greater than 2*(n-1).

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 3
7 1
8 2
9 6
10 5
11 1
12 2
13 6
14 13
15 8
16 1
17 2
18 6
19 20
20 31
21 13
22 1
23 2
24 6
25 20
26 61
27 73
28 21
29 1
30 2
31 6
32 20
33 76
34 185
35 172
36 34
37 1
38 2
39 6
40 20
41 76
42 269
43 577
44 399
45 55
46 1
47 2
48 6
49 20
50 76
51 300
52 979
53 1788
54 932
55 89
56 1
57 2
58 6
59 20
60 76
61 300
62 1189
63 3552
64 5540
65 2177
66 144
67 1
68 2
69 6
70 20
71 76
72 300
73 1252

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 6, 5, 1, 2, 6, 13, 8, 1, 2, 6, 20, 31, 13, 1, 2, 6, 20, 61, 73, 21, 1, 2, 6, 20, 76, 185, 172, 34, 1, 2, 6, 20, 76, 269, 577, 399, 55, 1, 2, 6, 20, 76, 300, 979, 1788, 932, 89, 1, 2, 6, 20, 76, 300, 1189, 3552, 5540, 2177, 144, 1, 2, 6, 20, 76, 300, 1252]