A186762 - cp's OEIS frontend

A186762 Number of permutations of {1,2,...,n} having no increasing odd cycles. 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	1
1	0
2	1
3	1
4	9
5	33
6	235
7	1517
8	12593
9	111465
10	1122819
11	12313409
12	147949593
13	1922353925
14	26918452691
15	403744456541
16	6460109224801
17	109820584161393
18	1976779056442179
19	37558742545087481
20	751175283283221129
21	15774677696321630525
22	347042934659313999539
23	7981987292809647817237

[1, 0, 1, 1, 9, 33, 235, 1517, 12593, 111465, 1122819, 12313409, 147949593, 1922353925, 26918452691, 403744456541, 6460109224801, 109820584161393, 1976779056442179, 37558742545087481, 751175283283221129, 15774677696321630525, 347042934659313999539, 7981987292809647817237]

cp's OEIS Frontend

A186762 Number of permutations of {1,2,...,n} having no increasing odd cycles. 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