4587520

Appears in sequences

• a(n) = binomial(n,3)*2^(n-3).at n=13A001789
• Expansion of g.f. (1+2*x)/(1-2*x)^2.at n=17A014480
• Theta series of laminated lattice LAMBDA_17.at n=5A023939
• Number of rooted graphs on n labeled nodes where the root has degree 3.at n=3A038096
• Triangle whose (i,j)-th entry is binomial(i,j)*4^(i-j)*8^j.at n=31A038238
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*4^j.at n=32A038282
• 19-almost primes (generalization of semiprimes).at n=18A069280
• a(i) = the number of occurrences of 9's in the palindromic compositions of n=2*i-1 = the number of occurrences of 10's in the palindromic compositions of n=2*i.at n=17A079862
• a(n)=(-1)^(n+1)*det(M(n)) where M(n) is the n X n matrix M(i,j)=min(abs(i-j),i).at n=21A080692
• a(n) = 2^n*(n^2 - n + 8)/8.at n=17A081908
• Products of the digits of e excluding 0.at n=11A084674
• a(n) is the denominator of the polynomial in e^2 giving the (2n)th du Bois Reymond constant.at n=8A085466
• Inverse binomial transform of n*Pell(n).at n=35A093968
• a(n) = n-th n-almost prime.at n=18A101695
• Triangle read by rows: T(n,k) (0<=k<=n) is the number of labeled graphs having k blue nodes and n-k green ones and only nodes of different colors can be joined by an edge.at n=40A111636
• Number of labeled graphs having n blue nodes and n green ones, where edges join only nodes of different colors.at n=4A111637
• a(n) = n*2^(floor(n/2)).at n=35A132344
• Denominators of a series expansion for Pi/2.at n=26A156269
• Triangle T(n, k) = (n-k)^n * binomial(n, n-k) for n < 2*k, k^n * binomial(n, k) for n >= 2*k with T(n, 0) = T(n, n) = 1, read by rows.at n=40A167040
• Triangle read by rows, T(n,k) = k^n*A056040(n), n>=0, 0<=k<=n.at n=40A195009