248360

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 number of nonnegative integers having a Levenshtein distance of n.at n=17A115780
• Number of length 5 arrays x(i), i=1..5 with x(i) in i..i+n and no value appearing more than 3 times.at n=10A250363