699050

Appears in sequences

• a(n) = floor(2^n / n).at n=23A000799
• 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=20A000975
• a(n) = (8^n + 2*(-1)^n)/3.at n=7A007613
• Barlow packings with group R3(bar)m(SO) that repeat after 6n+3 layers.at n=20A011954
• a(n) = a(n-1) + 2*a(n-2) with a(0)=0, a(1)=2.at n=20A014113
• a(n) = (2/3)*(4^n-1).at n=10A020988
• a(n) = C(n,0) + C(n,3) + ... + C(n,3[n/3]).at n=21A024493
• 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=19A026644
• Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 10.at n=28A043868
• Numbers that are repdigits in base 4.at n=29A048329
• a(n) = floor(8^8/n).at n=23A057070
• Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.at n=20A060590
• Number of 132 and 213-avoiding derangements of {1,2,...,n}.at n=21A061547
• Sequence A075166 interpreted as binary numbers and converted to decimal.at n=28A075165
• Expansion of (1 - x)/((1 + x)*(1 - 2*x)).at n=21A078008
• Expansion of (1-x)/(1+x+2*x^2+2*x^3).at n=39A078052
• 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=20A081374
• a(n) = floor of (2^n-1)/n.at n=23A082482
• a(n) = 2^n - A081374(n).at n=19A083322
• Duplicate of A020988.at n=10A084180