Number of permutations of {1,2,...,n} having no up-down cycles. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .

A186359

Number of permutations of {1,2,...,n} having no up-down cycles. A cycle (b(1), b(2), ...) is said to be up-down if, when written with its smallest element in the first position, it satisfies b(1)<b(2)>b(3)<... .

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =4a(5) =19a(6) =114a(7) =799a(8) =6392a(9) =57527a(10) =575270a(11) =6327971a(12) =75935652a(13) =987163475a(14) =13820288650a(15) =207304329751

External references