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.

A263744 T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and equal numbers of elements moved upwards and downwards.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 3
7 1
8 2
9 4
10 5
11 1
12 2
13 4
14 10
15 8
16 1
17 2
18 4
19 14
20 19
21 13
22 1
23 2
24 4
25 14
26 36
27 43
28 21
29 1
30 2
31 4
32 14
33 46
34 110
35 90
36 34
37 1
38 2
39 4
40 14
41 46
42 214
43 277
44 202
45 55
46 1
47 2
48 4
49 14
50 46
51 282
52 664
53 823
54 434
55 89
56 1
57 2
58 4
59 14
60 46
61 282
62 1118
63 2516
64 2292
65 971
66 144
67 1
68 2
69 4
70 14
71 46
72 282
73 1394
74 5962

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 4, 5, 1, 2, 4, 10, 8, 1, 2, 4, 14, 19, 13, 1, 2, 4, 14, 36, 43, 21, 1, 2, 4, 14, 46, 110, 90, 34, 1, 2, 4, 14, 46, 214, 277, 202, 55, 1, 2, 4, 14, 46, 282, 664, 823, 434, 89, 1, 2, 4, 14, 46, 282, 1118, 2516, 2292, 971, 144, 1, 2, 4, 14, 46, 282, 1394, 5962]