1101101

Appears in sequences

• Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=28A004290
• Primes written in base 2.at n=28A004676
• Decimal expansion of a(n) is given by the first n terms of the periodic sequence with initial period 1,1,0.at n=6A033137
• Sums of 5 distinct powers of 10.at n=13A038447
• a(n) is the negabinary expansion of n, that is, the expansion of n in base -2.at n=29A039724
• Coefficients of irreducible polynomials over GF(2) listed in lexicographic order.at n=20A058943
• Coefficients of primitive irreducible polynomials over GF(2) listed in lexicographic order.at n=16A058947
• n-th prime prime(n) written in base (prime(n) (mod prime(n-1))).at n=27A072807
• Smallest multiple of n using only one nonzero digit.at n=28A088599
• Smallest multiple of n using only one nonzero digit.at n=42A088599
• a(n) = 109 written in base n.at n=1A095608
• a(n) = 109 written in base 10 - n.at n=8A095609
• 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=7A102092
• Sequence A114386 in binary.at n=13A114387
• Sequence A115813 in binary.at n=24A115814
• Products associated with multipliers in A119483.at n=9A119484
• Products associated with multipliers in A119483.at n=13A119484
• Ordered list in binary of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word.at n=21A171676
• a(n) = A010062(n) written in binary: a(n+1) = a(n) + hammingweight(a(n)) in binary.at n=36A230297
• Binary numbers that begin and end with 1 and do not contain two adjacent zeros.at n=26A247647