37130

Appears in sequences

• a(n) = Sum_{k=0..n} binomial(6*n,6*k).at n=3A070967
• a(n) = Sum_{2*i+3*j=n, 0<=i<=n, 0<=j<=n} n!/( (2*i)!*(3*j)! ).at n=18A094715
• Constant term of the reduction of the polynomial p(n,x)=(1/2)((x+2)^n+(x-2)^n) by x^2->x+2.at n=9A192355
• Difference between sum of largest parts and sum of smallest parts of all partitions of n into an even number of parts.at n=32A211881
• Volume of right regular hexagonal pyramid with height and side lengths n, rounded down.at n=34A234729
• Number of (n+1) X (1+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=4A250870
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=14A250877
• Number of (5+1) X (n+1) 0..3 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)+x(i-1,j) in the j direction.at n=0A250882
• Number of achiral color patterns (set partitions) for a row or loop of length n using exactly 4 colors (sets).at n=17A304974
• a(n) = Sum_{k=0..floor(n/6)} binomial(n,6*k).at n=18A306847
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals: A(n,k) = Sum_{j=0..n} binomial(k*n,k*j).at n=48A308500
• Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.at n=51A361043
• Cogrowth sequence of the 12-element group C6 X C2 = <S,T | S^6, T^2, [S,T]>.at n=9A377627
• Cogrowth sequence for the 18-element group C6 X C3 = <S,T | S^6, T^3, [S,T]>.at n=6A378031