4354560

Appears in sequences

• Theta series of laminated lattice LAMBDA_10.at n=25A006909
• Expansion of e.g.f.: (1+2*x-2*x^2)/(1-x)^2.at n=9A052572
• E.g.f. (1+x-x^2)^2/(1-x)^2.at n=9A052643
• Triangle whose n-th row contains the n smallest numbers that are products of n distinct integers > 1, read by rows.at n=38A081957
• Orders of groups in the Thompson chain of subgroups of the Conway simple group Co_1.at n=3A258704
• Number of occurrences of k in the list of transitions t(j), j <= n!-1, of interchanges a(t(j)) <-> a(t(j)+1) created by Knuth's "Algorithm T" (Plain change transitions) to generate all permutations of n distinct elements, written as a triangle T(m,k), m = n-1 >= 1, k <= m.at n=52A321668
• Expansion of e.g.f. Sum_{k>=1} arctanh(x^k).at n=9A330505
• Expansion of e.g.f. Sum_{k>=1} arctan(x^k).at n=9A330511
• Triangle read by rows. T(n, k) = (-1)^(n-k)*(k+1)*binomial(n, k)*pochhammer(1-n, n-k).at n=47A360205
• Unitary highly totient numbers: numbers k that have more solutions x to the equation uphi(x) = k than any smaller k, where uphi is the unitary totient function (A047994).at n=38A361968
• a(n) = n!*tetranacci(n+3).at n=8A365293
• Triangle read by rows: T(n, k) = binomial(n, k - 1)*(k - 1)^(k - 1)*(n - k)*(n - k + 1)^(n - k).at n=39A368849
• Triangle read by rows: T(n, k) = n^k * Sum_{j=0..n} binomial(n - j, n - k) * Eulerian1(n, j).at n=25A372311
• a(n) = n^4*sigma_2(n).at n=12A386783
• Numbers k such that there exist three numbers x, y and z such that k = psi(x) = psi(y) = psi(z) = x + y + z.at n=14A387290