1101011

Appears in sequences

• Primes written in base 2.at n=27A004676
• Numbers k such that k^2 contains only digits {1,2,5}.at n=22A031153
• Sums of 5 distinct powers of 10.at n=12A038447
• a(n) is the negabinary expansion of n, that is, the expansion of n in base -2.at n=23A039724
• Palindromes whose square is a palindrome; also palindromes whose sum of squares of digits is less than 10.at n=34A057135
• Palindromes only using 0 and 1 (i.e., base-2 palindromes).at n=20A057148
• Palindromes n such that the n*m is also a palindrome, where m is the next palindrome after n.at n=35A083159
• Terms of A083393 such that the sum of the factorials of the digits is prime.at n=28A083394
• a(n) = 107 written in base n.at n=1A095604
• a(n) = 107 written in base 11 - n.at n=9A095605
• Semiprimes consisting of digits 0 and 1 only.at n=25A105991
• Palindromic primes in base 2 (written in base 2).at n=6A117697
• Palindromic primes in base 4 (written in base 4).at n=18A117699
• State of one-dimensional cellular automaton 'sigma' (Rule 150): 000,001,010,011,100,101,110,111 -> 0,1,1,0,1,0,0,1 at generation n, when started with a single ON cell, regarded as a binary number.at n=3A118110
• Products associated with multipliers in A119483.at n=18A119484
• Palindromes m such that reverse of m^2 is also a square.at n=36A128921
• Maximal (or "lazy") Lucas representation of n. Binary system for representing integers using Lucas numbers (A000032) as a base.at n=36A130311
• Ordered list in binary of the subwords (with leading zeros omitted) appearing in the infinite Fibonacci word.at n=20A171676
• A178796(n) in binary system.at n=11A179284
• Convert n to binary, use as coefficients of polynomial in GF(2)[x], apply the map f defined in A185000, write down coefficient vector of the result, highest powers first.at n=59A185544