11642400

Appears in sequences

• Product of the primitive roots of prime(n).at n=6A123475
• Product of the quadratic nonresidues of prime(n).at n=6A177861
• E.g.f.: exp(x^2/(x-1)).at n=11A293117
• Number of words w of length n such that each letter of the nonary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=2A321845
• Nonunitary superabundant numbers: numbers m such that nusigma(m)/m > nusigma(k)/k for all k < m, where nusigma(m) is the sum of nonunitary divisors of m (A048146).at n=37A329882
• E.g.f. satisfies A(x) = exp( x*A(x)*(exp(x^2*A(x)^2) - 1) ).at n=10A376351
• Products of primitive roots when n is 2, 4, p^k, or 2p^k (with p an odd prime), for all other n the value is defined to be 1.at n=16A382221
• a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=30A389300