2786918400
domain: N
Appears in sequences
- a(n) = Product_{p prime} p^{ Sum_{k>=0} floor[(n-1)/((p-1)p^k)]}.at n=9A053657
- Sum of unitary divisors of central binomial coefficient C(n, floor(n/2)).at n=32A064140
- Duplicate of A053657.at n=9A075265
- GCD of sigma(p#) and phi(p#) where p# = A002110(n) is the product of the first n primes.at n=10A078558
- Product of nonzero remainders of n mod k, for k = 1,2,3,...,n.at n=21A173392
- Type I Minkowski-Siegel mass constants (denominators).at n=8A241122
- a(n) = phi(n!)/phi(n).at n=13A273060
- A variant of payphone permutations: given a circular booth with n payphones, one of which is already occupied, a(n) is the number ways for n-1 people to choose the payphones in order, where each person chooses an unoccupied payphone such that the closest occupied payphone is as distant as possible.at n=17A362192
- Maximum possible product of differences of every pair in a set of nonnegative integers with sum n.at n=24A382328