14684571

Appears in sequences

• Rencontres numbers: number of permutations of [n] with exactly one fixed point.at n=10A000240
• a(n) = ceiling(n!/e) with e = A001113 = exp(1).at n=11A174318
• Triangle read by rows: T(n,k) is the number of permutations of [n] starting with 1, having no 3-sequences and having k successions (0 <= k <= floor(n/2)); a succession of a permutation p is a position i such that p(i +1) - p(i) = 1.at n=43A180186
• a(0)=0, a(n) = (a(n-1) * n) XOR n.at n=11A182390
• Triangle read by rows: T(n,k) = number of permutations of [n] having exactly one adjacent k-cycle. (n>=1, 1<=k<=n).at n=55A370527
• a(n) = A000166(floor(n/2)) if n is even otherwise A000240(floor((n + 1)/2)).at n=21A371998