2011111

Properties

Appears in sequences

• Consider the Levenshtein distance between k considered as a decimal string and k considered as a binary string. Then a(n) is the greatest number m such that the Levenshtein distance is n or 0 if no such number exists.at n=15A115779
• Ternary numbers consisting of a run of 2's, then a run of 0's, then a run of 1's.at n=24A371057
• Ternary numbers that are concatenated runs C(1)B(1)A(1)C(2)B(2)A(2)...C(k)B(k)A(k), where A(i) is a run of 1's, B(i) a run of 0's, and C(i) a run of 2's, for i = 1..k.at n=26A371109
• Prime numbersat n=149709