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.

A263683 T(n,k)=Number of length n arrays of permutations of 0..n-1 with each element moved by -k to k places and with no two consecutive decreases.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 3
7 1
8 2
9 5
10 5
11 1
12 2
13 5
14 12
15 8
16 1
17 2
18 5
19 17
20 26
21 13
22 1
23 2
24 5
25 17
26 53
27 58
28 21
29 1
30 2
31 5
32 17
33 70
34 155
35 131
36 34
37 1
38 2
39 5
40 17
41 70
42 277
43 429
44 295
45 55
46 1
47 2
48 5
49 17
50 70
51 349
52 1009
53 1210
54 662
55 89
56 1
57 2
58 5
59 17
60 70
61 349
62 1658
63 3487
64 3457
65 1487
66 144
67 1
68 2
69 5
70 17
71 70
72 349
73 2017

List of values

[1, 1, 2, 1, 2, 3, 1, 2, 5, 5, 1, 2, 5, 12, 8, 1, 2, 5, 17, 26, 13, 1, 2, 5, 17, 53, 58, 21, 1, 2, 5, 17, 70, 155, 131, 34, 1, 2, 5, 17, 70, 277, 429, 295, 55, 1, 2, 5, 17, 70, 349, 1009, 1210, 662, 89, 1, 2, 5, 17, 70, 349, 1658, 3487, 3457, 1487, 144, 1, 2, 5, 17, 70, 349, 2017]