5505024

Appears in sequences

• a(n) = (n+2)*2^(n-1).at n=19A001792
• Denominators of Taylor series expansion of arcsin(x). Also arises from arccos(x), arccsc(x), arcsec(x), arcsinh(x).at n=10A002595
• 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 (2,6)-perfect numbers.at n=8A019283
• Triangle read by rows: (i,j)-th entry is binomial(i,j)*3^(i-j)*8^j.at n=34A038226
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*3^j.at n=29A038281
• a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,2*k) = floor(n*2^(n-3)).at n=21A049610
• Composites of form prime+1 containing a record number of prime factors.at n=14A066617
• 20-almost primes (generalization of semiprimes).at n=8A069281
• Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.at n=29A071210
• Let A(n) be the matrix in the group GL(n,2) such that for 1 <= i, j <= n: A[i,j] = 1 if i+j = n+1 A[i,j] = 0 if i+j != n+1. a(n) is the size of the centralizer of A(n) in GL(n,2).at n=6A087540
• Triangle, read by rows, of coefficients for the second iteration of the hyperbinomial transform.at n=48A089460
• a(n) = (n^3 - n)*4^n.at n=6A128962
• a(n)=4a(n-2).at n=19A137480
• A007318 * A143097.at n=19A143099
• Denominator of Bernoulli(n, 1/8).at n=6A158654
• Inverse binomial transform of A026741.at n=21A168150
• a(n) = 21*2^n.at n=18A175805
• Binomial transform of A005563.at n=16A176027
• Triangle T(n,k) read by rows: T(n,k) is the number of rooted hypertrees on n labeled vertices with k hyperedges, n >= 2, k >= 1.at n=26A210586
• Number of compositions of n with at most one odd part.at n=39A211164