62720

Appears in sequences

• a(n) = sigma(sigma(...(sigma(n))...)) / n, where sigma (A000203) is iterated until a multiple of n is reached.at n=18A019295
• Expansion of log(1+tan(x)*x)/2.at n=5A024236
• Number of 5-colored labeled graphs on n nodes (divided by 1024).at n=6A052263
• McKay-Thompson series of class 16C for Monster.at n=22A058516
• Triangle T(n,k) = C_n(k)/2^(k*(k-1)/2) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1 <= k <= n).at n=25A058875
• Numbers whose digital sum is equal to the sum of primes from their smallest to largest prime factor.at n=22A076406
• Binomial transform of heptagonal numbers A000566.at n=10A084899
• Structured rhombic triacontahedral numbers (vertex structure 11).at n=19A100164
• G.f.: 8th root of weight enumerator of [64,45,8] extended BCH code (cf. A109481).at n=5A109482
• Triangle read by rows: T(n,k) = S1(n,k)*2^k, where S1(n,k) is an unsigned Stirling number of the first kind (cf. A008275) (n >= 1, 1 <= k <= n).at n=32A125553
• a(n) = the numerator of b(n): {b(n)} is such that the continued fraction (of rational terms) [b(1);b(2),...,b(n)] equals the n-th prime, for every positive integer n.at n=35A128270
• a(n) = the denominator of b(n): {b(n)} is such that the continued fraction (of rational terms) [b(1);b(2),...,b(n)] equals the n-th prime, for every positive integer n.at n=38A128271
• Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=41A137320
• Triangular sequence from a Pidduck polynomials expansion: p(t) = (t/(1 - t))*((1 + t)/(1 - t))^x.at n=32A137394
• Number of genus 2, degree n, simply ramified covers of an elliptic curve.at n=19A170991
• McKay-Thompson series of class 16C for the Monster group with a(0) = 2.at n=22A176143
• Number of permutations of {1,2,...,3n} whose cycle lengths are all divisible by 3.at n=3A178575
• Number of (n+2) X 4 binary arrays avoiding patterns 001 and 101 in rows and columns.at n=11A202196
• Numbers k such that the sum of prime factors of k (counted with multiplicity) equals five times the largest prime divisor of k.at n=27A212863
• Triangle read by rows: T(n,k) (n>=1, 1 <= k <= n) = number of permutations of [1..n] in which all cycle lengths are divisible by k.at n=38A213279