9175040

Appears in sequences

• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*8^j.at n=32A038238
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*4^j.at n=31A038282
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*5^j.at n=29A038283
• 20-almost primes (generalization of semiprimes).at n=18A069281
• Denominators in the Maclaurin series for arctan(1+x).at n=34A075554
• Smallest number beginning with 9 and having exactly n prime divisors counted with multiplicity.at n=19A106429
• a(n) = (2*n + 1) * 2^(n + 1).at n=17A118417
• a(n) = n-th integer from among those positive integers with an exponent of n in their prime-factorizations.at n=17A123904
• a(n) = n*2^floor((n+1)/2).at n=35A132314
• Matrix log of triangle A111636, where A111636(n,k) = (2^k)^(n-k)*C(n,k) for n>=k>=0.at n=41A134530
• a(0)=8, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.at n=19A159696
• a(n) = (n/4)*2^(n/2)*((1+sqrt(2))^2 + (-1)^n*(1-sqrt(2))^2).at n=35A187272
• a(n) = n^6*(4*n+3).at n=8A229149
• Number of ascending runs in {1,...,8}^n.at n=7A229282
• Triangle read by rows: terms T(n,k) of a binomial decomposition of n^n as Sum(k=0..n)T(n,k).at n=40A244121
• The product of the first n Catalan numbers and 2^(n^2).at n=4A247859
• Triangular array with n-th row giving coefficients of polynomial Product_{k = 2..n} (k + n*t) for n >= 1.at n=34A260687
• Triangle read by rows: T(n,k) is the number of independent sets of size k over all simple labeled graphs on n nodes, n>=0, 0<=k<=n.at n=31A277219
• Number of triangles in all simple labeled graphs on n nodes.at n=4A278704
• Triangle read by rows: T(n, k) = binomial(n, k - 1)*(k - 1)^(k - 1)*n*(n - k + 1)^(n - k).at n=41A369018