38692
domain: N
Appears in sequences
- Number of permutations p of (1,2,3,...,n) such that Sum_{k=1..n} gcd(k,p(k)) = sigma(n).at n=8A073343
- Number of n X 6 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..1 n X 6 array.at n=19A219500
- Chebyshev's S polynomials (A049310) evaluated at 34/3 and multiplied by powers of 3 (A000244).at n=3A248163
- a(n) is the number of numbers in the interval [2^(n-1), 2^n-1] that have exactly n divisors.at n=37A300509
- G.f. A(x) satisfies: 1 = Sum_{n>=0} x^n * ((1 + 3*x)^n - A(x))^(n+1), where A(0) = 0.at n=6A325583
- Index of 2^n in A353709.at n=20A353405