143360

Appears in sequences

• Triangle of coefficients in expansion of (1+8x)^n.at n=32A013615
• Triangle of coefficients in expansion of (4 + 5*x)^n.at n=29A013628
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*4^j.at n=34A038246
• Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*8^j.at n=19A038274
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*1^j.at n=31A038279
• Triangle whose (i,j)-th entry is binomial(i,j)*8^(i-j)*7^j.at n=16A038285
• a(n) = binomial(n-1,3)*n^(n-4).at n=7A053508
• a(n) = 2^(n-1)*(3*n-4).at n=13A053565
• Invert transform applied three times to Pascal's triangle A007318.at n=32A055374
• Invert transform applied three times to Pascal's triangle A007318.at n=31A055374
• a(n) = Product_{i=3..n} (prime(i) - 3).at n=7A059862
• Triangle read by rows: T(n, k) is the number of labeled trees on n nodes with maximal node degree k (0 < k < n).at n=31A061356
• Triangle of coefficients of polynomials (rising powers) useful for convolutions of A001333(n+1), n >= 0 (associated Pell numbers).at n=27A062133
• 14-almost primes (generalization of semiprimes).at n=18A069275
• 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 label k of the root.at n=23A071211
• Numbers whose digital sum is equal to the sum of primes from their smallest to largest prime factor.at n=27A076406
• Triangle read by rows: T(n,k)=binomial(n,k-1)*k^(k-1)*(n+1-k)^(n-k) (1<=k<=n).at n=24A103690
• Smallest number beginning with the digits of n that has exactly n prime factors (counted with multiplicity).at n=13A109686
• 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=32A111636
• 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=31A111636