1110110

Appears in sequences

• Sums of 5 distinct powers of 10.at n=17A038447
• a(n) = 118 written in base n.at n=1A095626
• a(n) = 118 written in base 10 - n.at n=8A095627
• Write the n-th prime in binary and change all 0's to 1's and all 1's to 0's.at n=32A171008
• Numbers n such that sopfr(n-1) | (n+sopfr(n+1)) and sopfr(n+1) | (n+sopfr(n-1)), where sopfr = A001414 (sum of prime factors with repetition).at n=30A196994
• a(n) = A010062(n) written in binary: a(n+1) = a(n) + hammingweight(a(n)) in binary.at n=38A230297
• Binary representation of the middle column of the "Rule 109" elementary cellular automaton starting with a single ON (black) cell.at n=6A267209
• Elias gamma code (EGC) for n.at n=13A281149
• Elias's omega code for n.at n=10A281193
• Binary representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 585", based on the 5-celled von Neumann neighborhood.at n=6A283137
• Binary representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood.at n=9A284183
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 350", based on the 5-celled von Neumann neighborhood.at n=12A287753
• Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 438", based on the 5-celled von Neumann neighborhood.at n=12A288300
• Square array, read by descending antidiagonals; T(n,k) is A001057(n) + A001057(k)*i, converted to complex binary (base -1 + i), where i=sqrt(-1).at n=30A340566
• Narayana weighted representation of n (the bottom version). Also binary representation of numbers not containing 00 or 010 as a substring.at n=33A350312
• Numbers with only digits "1" and two digits "0".at n=31A379268