Number of permutations of {1,2,...,n} having no increasing 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)<b(2)<b(3)<... .

A186755

Number of permutations of {1,2,...,n} having no increasing 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)<b(2)<b(3)<... .

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =5a(5) =23a(6) =129a(7) =894a(8) =7202a(9) =65085a(10) =651263a(11) =7161713a(12) =85922825a(13) =1116946192a(14) =15637356864a(15) =234562319757

External references