8386560

Appears in sequences

• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3), n > 3, with a(0)=a(1)=a(2)=0, a(3)=1.at n=25A000749
• a(n) = 2^n - C(n,0) - C(n,1) - C(n,2) - C(n,3).at n=23A002663
• a(n) = 2^(n-1)*(2^n - (-1)^n).at n=12A003674
• a(n) = 2^(n-1)*(2^n - 1), n >= 0.at n=12A006516
• Dual pairs of integrals arising from reflection coefficients.at n=24A007179
• a(n) = 4^n*(4^n - 1)/2.at n=6A026337
• Number of reversible strings with n beads of 2 colors. If more than 1 bead, not palindromic.at n=23A032085
• Number of reversible strings with n beads of 4 colors. If more than 1 bead, not palindromic.at n=11A032087
• Triangle: T(n,k), k<=n: groupoids with no symmetry with n elements and k idempotents.at n=13A038019
• Sum of every 4th entry of row n in Pascal's triangle, starting at binomial(n,2).at n=25A038505
• Number of elements of GF(2^n) with trace 0 and subtrace 1.at n=25A038519
• Number of elements of GF(2^n) with trace 1 and subtrace 1.at n=25A038521
• Largest number of binary size n (i.e., between (n-1)-th and n-th powers of 2) with the following property: cube of its number of divisors is larger than the number itself.at n=22A056767
• Number of subsets of {2,...,n} such that the product of their elements is congruent to 0 (mod n+1).at n=23A064381
• Smallest triangular number with n prime factors (counted with multiplicity).at n=16A075088
• a(n) = A000217(n^3) - n^3.at n=16A085744
• a(n) = A000225(n+3)-A052955(n).at n=20A086652
• 2^(n-1)J(n,1/2) where J(n,x)=n-th Jacobsthal polynomial.at n=23A109243
• Number of compositions of n with an even number of 1's.at n=25A113979
• G.f.: 1/((1-2*x)*(1-2*x^2)).at n=22A122746