A186754 - cp's OEIS frontend

A186754 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .

n	a(n)
0	1
1	0
2	1
3	0
4	1
5	1
6	1
7	1
8	3
9	1
10	5
11	5
12	7
13	6
14	1
15	23
16	36
17	25
18	25
19	10
20	1
21	129
22	234
23	166
24	110
25	65
26	15
27	1
28	894
29	1597
30	1316
31	686
32	385
33	140
34	21
35	1
36	7202
37	12459
38	10893
39	5754
40	2611
41	1106
42	266
43	28
44	1
45	65085
46	111451
47	97287
48	54559
49	22428
50	8841
51	2730
52	462
53	36
54	1
55	651263
56	1116277
57	963121
58	554670
59	229405
60	80871
61	26397
62	6000
63	750
64	45
65	1

[1, 0, 1, 0, 1, 1, 1, 1, 3, 1, 5, 5, 7, 6, 1, 23, 36, 25, 25, 10, 1, 129, 234, 166, 110, 65, 15, 1, 894, 1597, 1316, 686, 385, 140, 21, 1, 7202, 12459, 10893, 5754, 2611, 1106, 266, 28, 1, 65085, 111451, 97287, 54559, 22428, 8841, 2730, 462, 36, 1, 651263, 1116277, 963121, 554670, 229405, 80871, 26397, 6000, 750, 45, 1]

cp's OEIS Frontend

A186754 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles (0<=k<=n). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .

Table of values

List of values