A186756 - cp's OEIS frontend

A186756 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k nonincreasing cycles (0<=k<=floor(n/3)). 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	2
3	5
4	1
5	15
6	9
7	52
8	68
9	203
10	507
11	10
12	877
13	3918
14	245
15	4140
16	32057
17	4123
18	21147
19	280700
20	60753
21	280
22	115975
23	2645611
24	853914
25	13300
26	678570
27	26917867
28	11923428
29	396935
30	4213597
31	295934526
32	169127222
33	9710855
34	15400
35	27644437
36	3513447546
37	2469452843
38	215274774
39	1201200

[1, 1, 2, 5, 1, 15, 9, 52, 68, 203, 507, 10, 877, 3918, 245, 4140, 32057, 4123, 21147, 280700, 60753, 280, 115975, 2645611, 853914, 13300, 678570, 26917867, 11923428, 396935, 4213597, 295934526, 169127222, 9710855, 15400, 27644437, 3513447546, 2469452843, 215274774, 1201200]

cp's OEIS Frontend

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