A186768 - cp's OEIS frontend

A186768 Number of nonincreasing odd cycles in all permutations of {1,2,...,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) . A cycle is said to be odd if it has an odd number of entries.

n	a(n)
0	0
1	0
2	0
3	1
4	4
5	43
6	258
7	2525
8	20200
9	222119
10	2221190
11	28061889
12	336742668
13	4856656283
14	67993187962
15	1107076110629
16	17713217770064
17	322047491979087
18	5796854855623566
19	116542615962575753
20	2330852319251515060
21	51380800712458456259

[0, 0, 0, 1, 4, 43, 258, 2525, 20200, 222119, 2221190, 28061889, 336742668, 4856656283, 67993187962, 1107076110629, 17713217770064, 322047491979087, 5796854855623566, 116542615962575753, 2330852319251515060, 51380800712458456259]

cp's OEIS Frontend

A186768 Number of nonincreasing odd cycles in all permutations of {1,2,...,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) . A cycle is said to be odd if it has an odd number of entries.

Table of values

List of values