2973350

Appears in sequences

• Number of multiples of 3 in 0..2^n-1 with an even sum of base-2 digits.at n=24A036557
• a(n) = Sum_{k=0..n} binomial(6*n,6*k).at n=4A070967
• Expansion of g.f.: (1-2*x)*(1-4*x+x^2)/((1-x)*(1-3*x)*(1-4*x)).at n=12A087433
• a(n) = Sum_{2*i+3*j=n, 0<=i<=n, 0<=j<=n} n!/( (2*i)!*(3*j)! ).at n=24A094715
• 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=12A192355
• a(n) = Sum_{k=0..floor(n/6)} binomial(n,6*k).at n=24A306847
• 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=59A308500
• 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=61A361043
• Cogrowth sequence of the 12-element group C6 X C2 = <S,T | S^6, T^2, [S,T]>.at n=12A377627
• Cogrowth sequence for the 18-element group C6 X C3 = <S,T | S^6, T^3, [S,T]>.at n=8A378031
• a(n) = Sum_{k=0..n} binomial(4*n,6*k).at n=6A387849