1011011

Appears in sequences

• a(n) = n^2 written in base 3.at n=29A001738
• Least positive multiple of n written in base 3 using only 0 and 1.at n=28A004283
• Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,0,1.at n=6A033128
• Sums of 5 distinct powers of 10.at n=8A038447
• Coefficients of irreducible polynomials over GF(2) listed in lexicographic order.at n=17A058943
• Coefficients of primitive irreducible polynomials over GF(2) listed in lexicographic order.at n=13A058947
• Expansion of (1+10x)/((1-x)(1-1000x^3)).at n=6A092805
• Initial n terms of A023532(n) taken as digits.at n=7A094945
• a(n) = 91 written in base n.at n=1A095574
• a(n) = 91 written in base 15 - n.at n=13A095575
• Sequence A114386 in binary.at n=11A114387
• Sequence A115821 in binary.at n=15A115822
• The part of n in base phi left of the decimal using a least-greedy algorithm representation.at n=33A118240
• Semiprimes written in base 2.at n=30A122466
• Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base.at n=32A130311
• Ordered list in binary of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word.at n=19A171676
• Binary expansion of numbers in A171763.at n=28A171764
• a(n) = base-2 concatenation XYZ, where X = number of bits in binary expansion of n, Y = number of 0's, Z = number of 1's.at n=18A171823
• a(n) = base-2 concatenation XYZ, where X = number of bits in binary expansion of n, Y = number of 0's, Z = number of 1's.at n=20A171823
• a(n) = base-2 concatenation XYZ, where X = number of bits in binary expansion of n, Y = number of 0's, Z = number of 1's.at n=21A171823