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.

A263714 T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and every four consecutive elements having its maximum within 4 of its minimum.

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 14
15 8
16 1
17 2
18 6
19 24
20 31
21 11
22 1
23 2
24 6
25 24
26 78
27 34
28 17
29 1
30 2
31 6
32 24
33 120
34 60
35 39
36 25
37 1
38 2
39 6
40 24
41 120
42 72
43 50
44 46
45 37
46 1
47 2
48 6
49 24
50 120
51 144
52 54
53 52
54 64
55 57
56 1
57 2
58 6
59 24
60 120
61 144
62 60
63 54
64 70
65 104
66 84
67 1
68 2
69 6
70 24
71 120
72 144
73 108
74 54
75 72
76 116
77 161
78 127
79 1

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 6, 5, 1, 2, 6, 14, 8, 1, 2, 6, 24, 31, 11, 1, 2, 6, 24, 78, 34, 17, 1, 2, 6, 24, 120, 60, 39, 25, 1, 2, 6, 24, 120, 72, 50, 46, 37, 1, 2, 6, 24, 120, 144, 54, 52, 64, 57, 1, 2, 6, 24, 120, 144, 60, 54, 70, 104, 84, 1, 2, 6, 24, 120, 144, 108, 54, 72, 116, 161, 127, 1]