612360

Appears in sequences

• Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=26A003033
• Smallest integer m such that the product of every 4 consecutive integers > m has a prime factor > prime(n).at n=27A003033
• Line-labeled 2-trees with n nodes.at n=3A036363
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*6^j.at n=31A038224
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*3^j.at n=32A038257
• a(n) = (3*n+6)!!!/6!!!, related to A032031 ((3*n)!!! triple factorials).at n=5A051606
• a(n) = (n-1)*(n-2)*(n-3)*(3*n-10)*3^(n-5)/4.at n=9A086864
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k leaves (i.e., vertices of degree 0; n>=0, k>=1). A ternary tree is a rooted tree in which each vertex has at most three children and each child of a vertex is designated as its left or middle or right child.at n=32A120429
• Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k vertices of outdegree 2 (n >= 0, k >= 0).at n=27A120982
• Integers n such that for all i > n the largest prime factor of i(i+1)(i+2)(i+3) exceeds the largest prime factor of n(n+1)(n+2)(n+3).at n=14A193945
• Triangle read by rows: T(n,k) is the number of labeled rooted trees of height at most 2 that have exactly k nodes at a distance 2 from the root; n>=1, 0<=k<=n-1.at n=51A216255
• Where records occur in A222084.at n=28A222089
• a(n) = 9^n*(2*n + 1)!/n!.at n=3A254620
• Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence.at n=41A327321
• Triangle read by rows: T(n, k, m) = binomial(n, k) * k^n * m^k * (-1)^(n - k) for m = 2.at n=31A385899