A263752 - cp's OEIS frontend

A263752 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 5 of its minimum.

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	73
28	21
29	1
30	2
31	6
32	24
33	120
34	230
35	160
36	34
37	1
38	2
39	6
40	24
41	120
42	504
43	506
44	357
45	55
46	1
47	2
48	6
49	24
50	120
51	720
52	930
53	1128
54	814
55	89
56	1
57	2
58	6
59	24
60	120
61	720
62	1560
63	1794
64	2641
65	1836
66	144
67	1
68	2
69	6
70	24
71	120
72	720
73	2400

[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, 73, 21, 1, 2, 6, 24, 120, 230, 160, 34, 1, 2, 6, 24, 120, 504, 506, 357, 55, 1, 2, 6, 24, 120, 720, 930, 1128, 814, 89, 1, 2, 6, 24, 120, 720, 1560, 1794, 2641, 1836, 144, 1, 2, 6, 24, 120, 720, 2400]

cp's OEIS Frontend

A263752 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 5 of its minimum.

Table of values

List of values