1110111

Appears in sequences

• Sums of 6 distinct powers of 10.at n=3A038448
• Palindromes whose square is a palindrome; also palindromes whose sum of squares of digits is less than 10.at n=36A057135
• Palindromes only using 0 and 1 (i.e., base-2 palindromes).at n=21A057148
• Start with one 1 in the infinite vector of zeros, shift one right or left and sum mod 2 (bitwise-XOR) to get 11, then shift two steps and XOR to get 1111, then three steps and XOR to get 1110111, then four steps and so on.at n=3A068053
• a(n) = n-th state of cellular automaton generated by "Rule 94" when started with a single ON cell.at n=3A071033
• A086070 in binary.at n=19A086084
• a(n) = 119 written in base n.at n=1A095628
• a(n) = 119 written in base 10 - n.at n=8A095629
• Binary expansion of A074988.at n=6A110444
• Sequence A114396 in binary.at n=13A114397
• Sequence A115874 in binary.at n=9A115875
• A116641 in binary.at n=22A116642
• Binary representation of n-th iteration of the Rule 54 elementary cellular automaton starting with a single black cell.at n=3A118109
• Integers written in base phi, with the "decimal point" omitted.at n=5A130601
• Palindromes formed from the reflected decimal expansion of the concatenation of 1, 1, 1 and infinite 0's.at n=6A138145
• Palindromes with 2n-1 digits formed from the reflected decimal expansion of the concatenation of 1, 1, 1 and infinite 0's.at n=3A138146
• Cyclops numbers with binary digits only.at n=3A138148
• Strobogrammatic cyclops numbers.at n=21A153806
• Binary expansions of odd numbers with a single zero in their binary expansion.at n=12A190619
• Recursive palindromes in base 2: palindromes n where each half of the digits of n is also a recursive palindrome.at n=12A240602