2863311530

Appears in sequences

• a(2n) = 2*a(2n-1), a(2n+1) = 2*a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits).at n=32A000975
• a(n) = (8^n + 2*(-1)^n)/3.at n=11A007613
• a(n) = a(n-1) + 2*a(n-2) with a(0)=0, a(1)=2.at n=32A014113
• a(n) = (2/3)*(4^n-1).at n=16A020988
• a(n) = C(n,0) + C(n,3) + ... + C(n,3[n/3]).at n=33A024493
• a(n) = a(n-1) + 2*a(n-2) + 2, for n>=3, where a(0)= 1, a(1)= 2, a(2)= 4.at n=31A026644
• Number of 132 and 213-avoiding derangements of {1,2,...,n}.at n=33A061547
• Expansion of (1 - x)/((1 + x)*(1 - 2*x)).at n=33A078008
• Size of "uniform" Hamming covers of distance 1, that is, Hamming covers in which all vectors of equal weight are treated the same, included or excluded from the cover together.at n=32A081374
• a(n) = 2^n - A081374(n).at n=31A083322
• Partial sums of a Jacobsthal related sequence.at n=32A084184
• Binomial transform of (-1)^mod(n,3) (A257075).at n=33A086953
• Smallest numbers having in binary representation exactly n maximal groups of consecutive zeros.at n=16A087120
• a(n) is the smallest number such that the exponent of p=2 factor in 6*a(n)+4 equals n.at n=33A087231
• Generalized Jacobsthal sequence.at n=32A087628
• Pair reversal of a Jacobsthal sequence.at n=32A094359
• a(n) = J(n+1) mod J(n), J(n)=A001045(n).at n=33A112691
• a(n+3) = 3*(a(n+2) - a(n+1)) + 2*a(n).at n=33A130707
• Sequence is identical to its third differences: a(n+3) = 3*a(n+2) - 3*a(n+1) + 2*a(n), with a(0)=a(1)=1, a(2)=2.at n=32A130781
• a(n) = (2^n + 3 - 7*(-1)^n + 3*0^n)/6; or a(0) = 0 and for n > 0, a(n) = A005578(n-1) - (-1)^n.at n=34A135351