A186757 - cp's OEIS frontend

A186757 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles of length >=2 (0<=k<= n/2). 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	1
2	1
3	1
4	2
5	4
6	10
7	11
8	3
9	59
10	36
11	25
12	363
13	212
14	130
15	15
16	2491
17	1688
18	651
19	210
20	19661
21	14317
22	4487
23	1750
24	105
25	176536
26	129076
27	42435
28	12628
29	2205
30	1767540
31	1277159
32	451626
33	104755
34	26775
35	945
36	19460671
37	13974236
38	5068723
39	1120570
40	264880
41	27720

[1, 1, 1, 1, 2, 4, 10, 11, 3, 59, 36, 25, 363, 212, 130, 15, 2491, 1688, 651, 210, 19661, 14317, 4487, 1750, 105, 176536, 129076, 42435, 12628, 2205, 1767540, 1277159, 451626, 104755, 26775, 945, 19460671, 13974236, 5068723, 1120570, 264880, 27720]

cp's OEIS Frontend

A186757 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles of length >=2 (0<=k<= n/2). 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