A186759 - cp's OEIS frontend

A186759 Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k cycles that are either nonincreasing or of length 1 (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	1
4	0
5	1
6	1
7	4
8	0
9	1
10	4
11	9
12	10
13	0
14	1
15	11
16	53
17	35
18	20
19	0
20	1
21	41
22	280
23	268
24	95
25	35
26	0
27	1
28	162
29	1804
30	1904
31	903
32	210
33	56
34	0
35	1
36	715
37	12971
38	15727
39	8008
40	2408
41	406
42	84
43	0
44	1
45	3425
46	104600
47	142533
48	80323
49	25662
50	5502
51	714
52	120
53	0
54	1
55	17722
56	936370
57	1418444
58	871575
59	303385
60	68712
61	11256
62	1170
63	165
64	0
65	1

[1, 0, 1, 1, 0, 1, 1, 4, 0, 1, 4, 9, 10, 0, 1, 11, 53, 35, 20, 0, 1, 41, 280, 268, 95, 35, 0, 1, 162, 1804, 1904, 903, 210, 56, 0, 1, 715, 12971, 15727, 8008, 2408, 406, 84, 0, 1, 3425, 104600, 142533, 80323, 25662, 5502, 714, 120, 0, 1, 17722, 936370, 1418444, 871575, 303385, 68712, 11256, 1170, 165, 0, 1]

cp's OEIS Frontend

Table of values

List of values