159414

Appears in sequences

• usigma(n) = 2n + d(n), where d(n) is the number of divisors of n.at n=36A063829
• Number of permutations s of {1,2,...,n} such that |s(i)-i|>2 for each i=1,2,...,n.at n=11A075851
• T(n,k) = Number of permutations of 1..n+2*k-1 with each element displaced by at least k.at n=33A183244
• Numbers A055744(n) such that for any k < n, A055744(k) and A055744(n) do not have all their prime factors in common.at n=33A256431
• Number T(n,k) of permutations p of [n] such that |p(j)-j| >= k (for all j in [n]); triangle T(n,k), n >= 0, 0 <= k <= floor(n/2), read by rows.at n=39A306543