223200
domain: N
Appears in sequences
- Sigma(A033631(n)) {sigma is the sum of divisors function A000203}.at n=26A115619
- Triangle read by rows: T(n,k) is the number of permutations of [n] for which the shortest cycle length is k (1<=k<=n).at n=47A145877
- Triangle T(n, k, m) = f(n, m)/(f(k, m)*f(n-k, m)), where T(0, k, m) = 1, f(n, k) = Product_{j=1..n} ( j!*((k+1)^j -1)/k ), f(n, 0) = n!, and m = 1, read by rows.at n=17A156765
- Triangle T(n, k, m) = f(n, m)/(f(k, m)*f(n-k, m)), where T(0, k, m) = 1, f(n, k) = Product_{j=1..n} ( j!*((k+1)^j -1)/k ), f(n, 0) = n!, and m = 1, read by rows.at n=18A156765
- Number of (n+1)X8 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=10A207049
- Expansion of Product_{k>=1} ((1+x^k) / ((1-x^(2*k-1)) * (1-x^(8*k-4)))).at n=40A280908
- Triangular array read by rows: T(n,k) is the number of derangements whose shortest cycle has exactly k nodes; n >= 1, 1 <= k <= n.at n=47A348075
- a(n) = Sum_{p|n, p prime} n^omega(n/p).at n=59A369905