Triangle read by rows: T(n,k) is the number of cycle-up-down permutations of {1,2,...,n} having k fixed points (0 <= k <= n). A permutation is said to be cycle-up-down if it is a product of 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) < ... .

A186363

Triangle read by rows: T(n,k) is the number of cycle-up-down permutations of {1,2,...,n} having k fixed points (0 <= k <= n). A permutation is said to be cycle-up-down if it is a product of 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) =1a(3) =1a(4) =0a(5) =1a(6) =1a(7) =3a(8) =0a(9) =1a(10) =5a(11) =4a(12) =6a(13) =0a(14) =1a(15) =15a(16) =25a(17) =10a(18) =10a(19) =0a(20) =1a(21) =71a(22) =90a(23) =75a(24) =20a(25) =15a(26) =0a(27) =1a(28) =341a(29) =497

External references