1108536
domain: N
Appears in sequences
- Number of permutations in S_n with a certain property.at n=21A013498
- Expansion of 1/(1-4*x)^(7/2).at n=7A020918
- a(n) = A081537(n)/A081535(n), with a(2) = 1 by convention.at n=19A081538
- Triangle read by rows: T(n,k) = (2 * (binomial(n,k)) * (n + 2 * k + 3)!)/((k + 1)! * (k + 2)! * (n + 3)!).at n=26A087727
- Sequence arising from enumeration of domino tilings of Aztec Pillow-like regions.at n=9A092443
- a(n) = floor(lcm(1,2,...n)/(1+2+...+n)).at n=19A109922
- Numbers k such that the central binomial coefficient C(2*k,k) is divisible by k^3.at n=3A282163
- Least k such that Sum_{i=1..n} (-k)^i / i is a positive integer.at n=18A333073
- a(n) = (1+(-1)^n)/2*4^n*(C((3*n)/2-1,n))+(1-(-1)^n)/2*((C((3*n-1)/2,n))*(C(3*n-1,(3*n-1)/2)))/(C(n-1,(n-1)/2)).at n=7A348618
- Triangle read by rows. T(n, m) = (1/(n + 1)) * C(n + 1, m) * 4^n * C((3*n - m + 1)/2 - 1, n) if n is odd, otherwise (1/(n + 1)) * C(n + 1, m) * C((3*n - m)/2, n) * C(3*n - m, (3*n - m)/2) / C(n - m, (n - m)/2).at n=29A360636