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.

A263643 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 increases.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 2
7 1
8 2
9 5
10 2
11 1
12 2
13 5
14 9
15 2
16 1
17 2
18 5
19 17
20 11
21 2
22 1
23 2
24 5
25 17
26 41
27 19
28 2
29 1
30 2
31 5
32 17
33 70
34 75
35 27
36 2
37 1
38 2
39 5
40 17
41 70
42 226
43 156
44 44
45 2
46 1
47 2
48 5
49 17
50 70
51 349
52 538
53 340
54 65
55 2
56 1
57 2
58 5
59 17
60 70
61 349
62 1389
63 1417
64 738
65 104
66 2
67 1
68 2
69 5
70 17
71 70
72 349
73 2017
74 4255
75 3734
76 1567
77 155
78 2

List of values

[1, 1, 2, 1, 2, 2, 1, 2, 5, 2, 1, 2, 5, 9, 2, 1, 2, 5, 17, 11, 2, 1, 2, 5, 17, 41, 19, 2, 1, 2, 5, 17, 70, 75, 27, 2, 1, 2, 5, 17, 70, 226, 156, 44, 2, 1, 2, 5, 17, 70, 349, 538, 340, 65, 2, 1, 2, 5, 17, 70, 349, 1389, 1417, 738, 104, 2, 1, 2, 5, 17, 70, 349, 2017, 4255, 3734, 1567, 155, 2]