133497

Appears in sequences

• Rencontres numbers: number of permutations of [n] with exactly one fixed point.at n=8A000240
• Triangle T(n,k) of rencontres numbers (number of permutations of n elements with k fixed points).at n=46A008290
• Triangle of rencontres numbers.at n=29A008291
• Table T(n,k) giving number of ways of obtaining exactly one correct answer on an (n,k)-matching problem (1 <= k <= n).at n=44A076732
• Triangle read by rows: T(n,k) = number of partial derangements, that is, the number of permutations of n distinct, ordered items in which exactly k of the items are in their natural ordered positions, for n >= 0, k = n, n-1, ..., 1, 0.at n=53A098825
• Triangle read by rows: T(n,k) is the number of partial bijections (or subpermutations) of an n-element set of height k (height(alpha) = |Im(alpha)|) and with exactly 1 fixed point.at n=44A144090
• Triangle T(n, k) = binomial(n, k)*A000166(n-k)*k^n with T(0, 0) = 1, read by rows.at n=46A156788
• Triangle read by rows: T(n,k) is the number of non-derangements of {1,2,...,n} for which the difference between the largest and smallest fixed points is k (n>=1; 0 <= k <= n-1).at n=36A161129
• Triangle read by rows: T(n,k) is the number of non-derangements of {1,2,...,n} for which the difference between the largest and smallest fixed points is k (n>=1; 0 <= k <= n-1).at n=46A161129
• a(n) = ceiling(n!/e) with e = A001113 = exp(1).at n=9A174318
• Numbers k such that k^3 divides 17^(k^2) + 1.at n=34A177817
• 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=31A180186
• Triangle read by rows: T(n,k) is the number of permutations of [n] with k circular successions (0<=k<=n-1). A circular succession in a permutation p of [n] is either a pair p(i), p(i+1), where p(i+1)=p(i)+1 or the pair p(n), p(1) if p(1)=p(n)+1.at n=36A180188
• a(0)=0, a(n) = (a(n-1) * n) XOR n.at n=9A182390
• Sum of the partition parts of 3n into 3 parts.at n=38A235988
• Triangle read by rows: T(n, k) = Sum_{j=0..n} C(-j-1, -n-1)*L(j, k), L the unsigned Lah numbers A271703, for n >= 0 and 0 <= k <= n.at n=46A271706
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) = n! * Sum_{j=0..n} (-1)^(n-j) * j^k/j!.at n=64A368724
• 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=36A370527
• a(n) = A000166(floor(n/2)) if n is even otherwise A000240(floor((n + 1)/2)).at n=17A371998
• Triangle read by rows: T(n,k) = (-1)^(n+1) * A000166(n) + (-1)^(k) * A000166(k) for n >= 2 and 1 <= k <= n-1.at n=29A373966