42467328

Appears in sequences

• a(n) = n^(n-2)*(n+2)^(n-1).at n=5A006236
• Complexity of tensor sum of n graphs; or spanning trees on n-cube.at n=4A006237
• Expansion of (1 + 2*x)/(1 - 2*x)^3.at n=17A014477
• Product of the nonprime divisors of n.at n=47A087652
• a(1) = 1, a(2) = (2*1)/1 = 2. a(n+1) = (n+1)*a(n) divided by the largest prime divisor of a(n).at n=23A100773
• Smallest number beginning with 4 and having exactly n prime divisors counted with multiplicity.at n=22A106424
• Numbers of divisors associated with the entries of A120585.at n=33A120586
• a(n) = phi(n!!) where phi is the Euler totient function. In other words, a(n) = A000010(A006882(n)).at n=17A129335
• a(n) = 0 if n is 1 or a prime, otherwise a(n) = product of composite (nonprime) divisors of n.at n=47A157721
• Sorted orders of automorphism groups of distinct solutions in the mix of 2 or 3 regular convex 4-polytopes.at n=17A199811
• Square array read by antidiagonals: T(m,n) = number of spanning trees in C_m X C_n.at n=24A212796
• Row 4 of array in A212796.at n=3A212799
• Number of spanning trees of the (n,n)-torus grid graph.at n=3A212800
• a(n) is denominator of y(n), where y(n+1) = (25*n^2-1)/48 * y(n) + (1/2)*Sum_{k=1..n}y(k)*y(n+1-k), with y(0) = -1.at n=4A269419
• Terms of A025487 from which the distance to the next larger prime is a composite number.at n=17A329894
• The least number of the form 2^i*3^j (i, j >= 0) which can be represented as a product of the greatest number of distinct positive integers in exactly n ways.at n=26A338261
• Number of spanning trees in the k_1 X ... X k_j grid graph, where (k_1 - 1, ..., k_j - 1) is the partition with Heinz number n.at n=15A338832
• a(n) = n^npf(n) / rad(n), where npf(n) is the number of prime factors with multiplicity of n.at n=47A363923
• Array read by antidiagonals: T(n,m) is the number of spanning trees in the n X m rook graph K_n X K_m.at n=22A384845
• Array read by antidiagonals: T(n,m) is the number of spanning trees in the n X m rook graph K_n X K_m.at n=26A384845