110110

Appears in sequences

• Binary reflected Gray code.at n=36A014550
• a(n+1) = a(n) converted to base 10 from base 4 (written in base 10); a(1)=4.at n=5A023378
• Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,1,0.at n=5A033137
• Reverse and add (in binary).at n=7A035526
• Sums of 4 distinct powers of 10.at n=11A038446
• Start with Pascal's triangle; a(n) is the sum of the numbers on the periphery of the n-th central rhombus containing exactly 4 numbers.at n=8A081496
• a(n) = 54 written in base n.at n=1A095500
• a(n) = 54 written in base 10 - n.at n=8A095501
• Even nonnegative integers in base 2 (bisection of A007088).at n=27A099820
• a(n)< a(n+1) and: each digit is the absolute difference of the previous two; each digit is the absolute difference of the next two; each digit is the absolute difference of its two neighbors.at n=6A102092
• Dual Zeckendorf representation of n or the maximal (binary) Fibonacci representation. Also list of binary vectors not containing 00.at n=26A104326
• a(n) = binomial(n+2,2)*binomial(n+5,5).at n=9A107417
• a(n) = {n concatenate R(n)}*{ R(n) concatenate n}, where R(n) = digit reversal of n.at n=10A110722
• a(n) = binomial(n,4) - binomial(floor(n/2),4) - binomial(ceiling(n/2),4).at n=43A111385
• Sequence A114386 in binary.at n=6A114387
• Sequence A115803 in binary.at n=11A115804
• Sequence A115849 in binary.at n=20A115850
• a(n) = Product_{k=1..n} P(k), where P(k) is the smallest prime >= 2*k.at n=5A118748
• Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base.at n=22A130311
• Expansion of f(q) * f(q^5) / phi(-q^2)^2 in powers of q where f(), phi() are Ramanujan theta functions.at n=36A145722