2661120

Appears in sequences

• Denominators of coefficients for central differences M_{4}^(2*n).at n=5A002676
• Sum of divisors of k such that k and k+1 have the same number and sum of divisors.at n=19A054005
• Number of degree-n permutations of order exactly 30.at n=10A061128
• Number of elements of S_n having the maximum possible order g(n), where g(n) is Landau's function (A000793).at n=11A074859
• a(1) = 1. For n >= 2, a(n) = sum of the two (not necessarily distinct) earlier terms, a(j) and a(k), which maximizes d(a(j)+a(k)), where d(m) is the number of positive divisors of m. a(n) = the maximum (a(j)+a(k)) if more than one such sum has the maximum number of divisors.at n=26A115386
• a(n) = lcm(b(0),b(1),b(2),...,b(n)), where b(m) = A130479(m).at n=11A130480
• A triangular sequence from umbral calculus expansion of _Simon Plouffe_'s rational polynomial for A002890: p(x,t) = exp(x*t)*(1 - 6*t + 9*t^2 - 4*t^3 + t^4)/(4*t - 1)/(2*t - 1).at n=48A137514
• Partition number array, called M31(6), related to A049374(n,m)= |S1(6;n,m)| (generalized Stirling triangle).at n=45A144356
• a(n) = 2^n * (n + 3)!!.at n=8A155160
• A partition product of Stirling_1 type [parameter k = -6] with biggest-part statistic (triangle read by rows).at n=34A157386
• a(n) = [r]*[2*r]*...*[n*r], where r=sqrt(2) and []=floor.at n=8A180736
• v(n+1)/v(n), where v=A203530.at n=4A203532
• Common Sigma, Uncommon Clique Numbers: a(n) is the minimal s for which there exists a set of n pairwise relatively prime integers with a sigma value of s.at n=30A239635
• Common Sigma, Uncommon Clique Numbers: a(n) is the minimal s for which there exists a set of n pairwise relatively prime integers with a sigma value of s.at n=31A239635
• a(n) = 5^n*Gamma(n+1/5)*Gamma(n+1)/Gamma(1/5).at n=5A276482
• Positions of records in A220400.at n=34A297160
• Denominator of 24*Stirling_2(n,4)/n!.at n=10A324004
• a(n) is the smallest number m with exactly n divisors that are Zuckerman numbers, or -1 if there is no such m.at n=35A335038
• Integers whose number of divisors that are Zuckerman numbers sets a new record.at n=25A340638
• Triangle read by rows. The Faulhaber numbers. F(0, k) = 1 and otherwise F(n, k) = (n + 1)!*(-1)^(k+1)*Sum_{j=0..floor((k-1)/2)} C(2*k-2*j, k+1)*C(2*n+1, 2*j+1) * Bernoulli(2*n-2*j) / (k - j).at n=42A354042