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.

A263693 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 three consecutive elements having its maximum within 3 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 7
16 1
17 2
18 6
19 24
20 14
21 11
22 1
23 2
24 6
25 24
26 18
27 16
28 16
29 1
30 2
31 6
32 24
33 36
34 18
35 22
36 25
37 1
38 2
39 6
40 24
41 36
42 20
43 24
44 36
45 37
46 1
47 2
48 6
49 24
50 36
51 36
52 24
53 40
54 56
55 57
56 1
57 2
58 6
59 24
60 36
61 36
62 27
63 40
64 64
65 85
66 85
67 1
68 2
69 6
70 24
71 36
72 36
73 48
74 40
75 64
76 100
77 125
78 130
79 1
80 2
81 6
82 24
83 36

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 6, 5, 1, 2, 6, 14, 7, 1, 2, 6, 24, 14, 11, 1, 2, 6, 24, 18, 16, 16, 1, 2, 6, 24, 36, 18, 22, 25, 1, 2, 6, 24, 36, 20, 24, 36, 37, 1, 2, 6, 24, 36, 36, 24, 40, 56, 57, 1, 2, 6, 24, 36, 36, 27, 40, 64, 85, 85, 1, 2, 6, 24, 36, 36, 48, 40, 64, 100, 125, 130, 1, 2, 6, 24, 36]