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.

A263597 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 median of every three consecutive elements nondecreasing.

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 12
15 8
16 1
17 2
18 6
19 16
20 25
21 13
22 1
23 2
24 6
25 16
26 41
27 57
28 21
29 1
30 2
31 6
32 16
33 52
34 108
35 124
36 34
37 1
38 2
39 6
40 16
41 52
42 164
43 280
44 268
45 55
46 1
47 2
48 6
49 16
50 52
51 208
52 476
53 729
54 588
55 89
56 1
57 2
58 6
59 16
60 52
61 208
62 676
63 1428
64 1908
65 1285
66 144
67 1
68 2
69 6
70 16
71 52
72 208
73 800
74 2208
75 4308

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 6, 5, 1, 2, 6, 12, 8, 1, 2, 6, 16, 25, 13, 1, 2, 6, 16, 41, 57, 21, 1, 2, 6, 16, 52, 108, 124, 34, 1, 2, 6, 16, 52, 164, 280, 268, 55, 1, 2, 6, 16, 52, 208, 476, 729, 588, 89, 1, 2, 6, 16, 52, 208, 676, 1428, 1908, 1285, 144, 1, 2, 6, 16, 52, 208, 800, 2208, 4308]