430080

Appears in sequences

• Coefficients of Chebyshev polynomials: n*(2*n+1) * 4^(n-1).at n=6A002700
• a(n) = 2^(n-2)*binomial(n+1,2).at n=12A052482
• a(n) = 4^(n-1) * n! * Catalan(n-1) for n > 0, with a(0) = 0.at n=5A052734
• Triangle of coefficients of Chebyshev's U(n,2*x-1) polynomials (exponents of x in increasing order).at n=42A053124
• Triangle of coefficients of Chebyshev's U(n,2*x-1) polynomials (exponents of x in decreasing order).at n=38A053125
• Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).at n=12A061218
• a(n) = number of unicyclic connected simple graphs whose cycle has length 4.at n=4A065889
• 15-almost primes (generalization of semiprimes).at n=29A069276
• Sequence associated with a(n) = 2*a(n-1) + k*(k+2)*a(n-2).at n=13A080929
• Inverse binomial transform of n^2*3^(n-1).at n=12A084857
• Triangle: row #n has n+1 terms. T(n,m) = 4^m (2n+1)! / ( (2n-2m)! (2m+1)! ).at n=34A085841
• a(n) = smallest positive number that occurs exactly n times as a difference between two positive squares.at n=43A094191
• Triangle T(n,k) of numbers of connected (unicyclic) graphs with unique cycle of length k (3<=k<=n), on n labeled nodes.at n=16A098909
• Denominator of expansion of RiemannSiegelTheta(t) about infinity.at n=3A114721
• Triangle read by rows: G(s, rho) = ((s-1)!/s)*Sum_{i=0..s-1} ((s-i)/i!)*(s*rho)^i.at n=32A122525
• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph consists of a single node or has a unique cycle of length 4.at n=44A144209
• Numbers k such that sigma(tau(k)) = rad(k).at n=14A173582
• Triangle T(n, k) = n!*q^k/(n-k)! if floor(n/2) > k-1 otherwise n!*q^(n-k)/k!, with q = 4, read by rows.at n=40A174378
• Area A of the triangles such that A, the sides and two medians are integers.at n=16A181928
• Number of ways to form k labeled groups, each with a distinct leader, using n people. Triangle T(n,k) = n!*k^(n-k)/(n-k)! for 1 <= k <= n.at n=31A199673