76440

Appears in sequences

• Boustrophedon transform of Catalan numbers 1, 1, 1, 2, 5, 14, ...at n=9A000736
• Number of diagonal dissections of an n-gon into 5 regions.at n=7A033277
• Number of diagonal dissections of a convex (n+9)-gon into n+1 regions.at n=4A033281
• Partial sums of A051879.at n=11A050405
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^3-M)/2, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=49A096034
• A certain partition array in Abramowitz-Stegun (A-St) order.at n=33A134149
• Triangle T, read by rows, where T(n,k) = A007559(n-k)*C(n,k) where A007559 equals the triple factorials in column 0.at n=30A136215
• A triangle of recursive Fibonacci Lah numbers: f(n) = Fibonacci(n)*f(n - 1), L(n, k) = binomial(n-1, k-1)*(f(n)/f(k)).at n=32A137478
• Triangle of unsigned 4-Lah numbers.at n=32A143499
• Eigentriangle by rows, termwise products of A078812 and its eigensequence, A125274.at n=41A144254
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent cycles (0 <= k <= n). An adjacent cycle is a cycle of the form (i, i+1, i+2, ...) (including 1-element cycles).at n=59A184184
• Numbers with prime factorization p*q*r*s^2*t^3 (where p, q, r, s, t are distinct primes).at n=18A190111
• Number of s in {1,...,n}^n having shortest run with the same value of length 6.at n=15A228632
• a(n) = 70*(n+1)*binomial(2*n+1,n+1)/(n+5).at n=6A246507
• Cayley's triangle of V numbers; triangle V(n,k), n >= 4, n <= k <= 2*n-4, read by rows.at n=40A259476
• a(n) = Sum_{k=0..n} binomial(n, 2k)*binomial(n-k, k)*(-1)^k.at n=14A278415
• Triangle read by rows, interpolating between the central binomial coefficients and the central coefficients of the Catalan triangle. T(n, k) for 0 <= k <= n.at n=25A330798
• a(n) is the denominator of Sum_{i > 0} 1/(Fibonacci(i)*Fibonacci(i+2n)).at n=3A333089
• Coefficient triangle of generalized Laguerre polynomials n!*L(n,n,x) (rising powers of x).at n=32A343861
• a(n) = ((n + 1)^2 * (5*n + 4)*n) / 12.at n=20A368046