53760

Appears in sequences

• a(n) = 4^(n-4)*(n-1)*(n-2)*(n-3).at n=4A006044
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (3,k)-perfect numbers.at n=25A019292
• Number of rooted connected graphs on n labeled nodes where the root has degree 3.at n=2A038097
• A triangle related to A000045 (Fibonacci numbers).at n=39A039948
• a(n) = n^2*(n-1)*(n-2).at n=14A047929
• Triangle read by rows: T(n,k) = number of labeled digraphs with n nodes and k arcs and without directed paths of length >=2, with 0 <= k <= floor(n^2/4).at n=36A052296
• Expansion of e.g.f. (1-sqrt(1-8*x))/2.at n=5A052713
• 7-fold convolution of A000302 (powers of 4).at n=4A054337
• Number of 2-enumeration of 4n X 4n quarter-turn symmetric alternating-sign matrices.at n=3A059487
• 12-almost primes (generalization of semiprimes).at n=29A069273
• Triangle with T(n,k)=n!*(k-1)^k/k! where 1<=k<=n.at n=30A076482
• a(n) = the least positive integer k such that b(k) = n, where b(k) (A076526) is defined by b(k) = r * max{e_1,...,e_r} if k = p_1^e_1 *...* p_r^e_r is the canonical prime factorization of k.at n=35A076745
• Expansion of (1-x)/(1-2*x+2*x^2-2*x^3).at n=28A078003
• a(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).at n=7A082569
• Diagonal of A083788.at n=10A083789
• Prime signatures pertaining to A083788.at n=65A083791
• Triangle of least prime signatures such that T(1,1)= 1; T(r,j) = 2*T(r,j-1) for j>1 and T(r+1,1) is the smallest value in A025487 not appearing on an earlier row.at n=53A085988
• Duplicate of A083789.at n=10A086562
• Triangular array of coefficients multiplied by n! of polynomials in e. These give the expected number of trials needed for the sum of uniform random variables from the interval [0,1] to exceed n+1.at n=32A089087
• Triangle read by rows: a(n,k) = number of k-length walks in the Hasse diagram of a Boolean algebra of order n.at n=41A090802