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.

A263703 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 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 13
22 1
23 2
24 6
25 24
26 78
27 56
28 21
29 1
30 2
31 6
32 24
33 120
34 110
35 104
36 34
37 1
38 2
39 6
40 24
41 120
42 168
43 169
44 208
45 55
46 1
47 2
48 6
49 24
50 120
51 288
52 204
53 301
54 418
55 89
56 1
57 2
58 6
59 24
60 120
61 288
62 276
63 348
64 616
65 873
66 144
67 1
68 2
69 6
70 24
71 120
72 288
73 456
74 374

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 6, 5, 1, 2, 6, 14, 8, 1, 2, 6, 24, 31, 13, 1, 2, 6, 24, 78, 56, 21, 1, 2, 6, 24, 120, 110, 104, 34, 1, 2, 6, 24, 120, 168, 169, 208, 55, 1, 2, 6, 24, 120, 288, 204, 301, 418, 89, 1, 2, 6, 24, 120, 288, 276, 348, 616, 873, 144, 1, 2, 6, 24, 120, 288, 456, 374]