A338849 - cp's OEIS frontend

A338849 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] in a circle where adjacent values cannot be consecutive modulo n, rotations are distinct.

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	0
19	0
20	10
21	1
22	6
23	18
24	12
25	24
26	60
27	36
28	1
29	7
30	28
31	42
32	112
33	280
34	420
35	322
36	1
37	8
38	40
39	96
40	336
41	1040
42	2400
43	3696
44	2832
45	1
46	9
47	54
48	180
49	792
50	3060
51	9540
52	22428
53	35280
54	27954
55	1
56	10
57	70
58	300
59	1600
60	7540
61	29880
62	95340
63	229280
64	369540
65	299260

[1, 1, 1, 1, 2, 0, 1, 3, 0, 0, 1, 4, 4, 0, 0, 1, 5, 10, 0, 0, 10, 1, 6, 18, 12, 24, 60, 36, 1, 7, 28, 42, 112, 280, 420, 322, 1, 8, 40, 96, 336, 1040, 2400, 3696, 2832, 1, 9, 54, 180, 792, 3060, 9540, 22428, 35280, 27954, 1, 10, 70, 300, 1600, 7540, 29880, 95340, 229280, 369540, 299260]

cp's OEIS Frontend

A338849 Triangle read by rows: T(n,k) is the number of permutations of k elements from [1..n] in a circle where adjacent values cannot be consecutive modulo n, rotations are distinct.

Table of values

List of values