508032

Appears in sequences

• a(n) = product of nonzero digits of n! (A000142).at n=15A067067
• a(1) = 1, a(n) = smallest multiple of a(n-1) > a(n-1) such that a(n) + 1 is a prime.at n=11A084716
• a(0) = 1; for n>0, a(n) = 16 times sum of cubes of divisors of n.at n=30A092820
• Delannoy paths counted by number of weak peaks.at n=50A133214
• A triangle of polynomial coefficients related to Mittag-Leffler polynomials: p(x,n)=Sum[Binomial[n, k]*Binomial[n - 1, n - k]*2^k*x^k, {k, 0, n}]/(2*x).at n=49A156136
• Number of alpha-labeled graphs with n edges and at most n vertices.at n=10A245519
• Product_{n>=1} (1 + x^n)^a(n) = g.f. of A005169 (fountains of coins).at n=29A305840
• a(n) = Product_{p prime, p <= n} floor(n/p).at n=42A309912
• a(n) = Product_{p prime, p <= n} floor(n/p).at n=43A309912
• Intersection of A001694 and A195069.at n=27A316499
• a(n) = Product_{d|n} lcm(tau(d), sigma(d)) where tau(k) is the number of divisors of k (A000005) and sigma(k) is the sum of divisors of k (A000203).at n=11A334806
• a(n) is the smallest number k for which the width n at the diagonal is one smaller than the maximum width of the symmetric representation of sigma(k).at n=10A338536