A277031 - cp's OEIS frontend

A277031 Number T(n,k) of permutations of [n] where the minimal cyclic distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	0
7	5
8	0
9	1
10	0
11	20
12	3
13	0
14	1
15	0
16	109
17	10
18	0
19	0
20	1
21	0
22	668
23	44
24	7
25	0
26	0
27	1
28	0
29	4801
30	210
31	28
32	0
33	0
34	0
35	1
36	0
37	38894
38	1320
39	90
40	15
41	0
42	0
43	0
44	1
45	0
46	353811
47	8439
48	554
49	75
50	0
51	0
52	0
53	0
54	1
55	0
56	3561512
57	63404
58	3542
59	310
60	31
61	0
62	0
63	0
64	0
65	1
66	0
67	39374609
68	517418
69	23298
70	1276
71	198
72	0
73	0
74	0
75	0
76	0
77	1

[1, 0, 1, 0, 1, 1, 0, 5, 0, 1, 0, 20, 3, 0, 1, 0, 109, 10, 0, 0, 1, 0, 668, 44, 7, 0, 0, 1, 0, 4801, 210, 28, 0, 0, 0, 1, 0, 38894, 1320, 90, 15, 0, 0, 0, 1, 0, 353811, 8439, 554, 75, 0, 0, 0, 0, 1, 0, 3561512, 63404, 3542, 310, 31, 0, 0, 0, 0, 1, 0, 39374609, 517418, 23298, 1276, 198, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A277031 Number T(n,k) of permutations of [n] where the minimal cyclic distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values