3727360
domain: N
Appears in sequences
- Euler transform of A000389.at n=12A000417
- Sextuple factorial numbers: a(n) = Product_{k=0..n-1} (6*k+2).at n=6A047657
- Sequence associated with recurrence a(n) = 2*a(n-1) + k*(k+2)*a(n-2).at n=12A080951
- Sextuple factorials, 6-factorials, n!!!!!!, n!6.at n=32A085158
- Triangle read by rows: t(n,m)=If[m == 0, 1, Product[m*k + 2, {k, 0, n}]].at n=26A153190
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(2*i-1) ) and m = 2, read by rows.at n=29A156697
- Triangle T(n, k, m) = t(n,m)/( t(k,m) * t(n-k,m) ) with T(n, 0, m) = T(n, n, m) = 1, where t(n, m) = Product_{j=1..n} Product_{i=1..j-1} ( 1 - (m+1)*(2*i-1) ) and m = 2, read by rows.at n=34A156697
- Expansion of x^5*(4 - 5*x)/(1 - 2*x)^4.at n=17A268598
- Expansion of e.g.f. (1/3!)*sin^3(x)/cos(x) (coefficients of odd powers only).at n=6A278079
- Triangular array read by rows. Let P be the poset of all even sized subsets of [2n] ordered by inclusion. T(n,k) is the number of intervals in P with length k, 0<=k<=n, n>=0.at n=38A328821