A338838 - cp's OEIS frontend

A338838 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] where adjacent values cannot be consecutive modulo n.

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	0
6	1
7	3
8	0
9	0
10	1
11	4
12	4
13	0
14	0
15	1
16	5
17	10
18	10
19	10
20	10
21	1
22	6
23	18
24	36
25	60
26	84
27	60
28	1
29	7
30	28
31	84
32	210
33	434
34	630
35	462
36	1
37	8
38	40
39	160
40	544
41	1552
42	3440
43	5168
44	3920
45	1
46	9
47	54
48	270
49	1170
50	4338
51	13158
52	30366
53	47178
54	36954
55	1
56	10
57	70
58	420
59	2220
60	10220
61	39780
62	125220
63	298060
64	476220
65	382740

[1, 1, 1, 1, 2, 0, 1, 3, 0, 0, 1, 4, 4, 0, 0, 1, 5, 10, 10, 10, 10, 1, 6, 18, 36, 60, 84, 60, 1, 7, 28, 84, 210, 434, 630, 462, 1, 8, 40, 160, 544, 1552, 3440, 5168, 3920, 1, 9, 54, 270, 1170, 4338, 13158, 30366, 47178, 36954, 1, 10, 70, 420, 2220, 10220, 39780, 125220, 298060, 476220, 382740]

cp's OEIS Frontend

A338838 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] where adjacent values cannot be consecutive modulo n.

Table of values

List of values