A sequence with Vladimir Iosifovich (and his wife)

> Informally, the Levenshtein distance between two (human beings in a garden) words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.

We build hereunder a sequence S of integer > 0 such that the successive digits d of S are the successive Levenshtein distances between two adjacent terms of S.
When possible, S is always extended with the smallest positive integer not yet present in S.
Thank you Giorgos for correcting my first attempt!-)
(click on the seq to enlarge it)


Here are 89 terms of S computed last night by Giorgos Kalogeropoulos:
S = 1, 2, 10, 11, 11, 12, 13, 3, 4, 5, 14, 15, 200, 6, 1000, 22111, 2111, 7, 8, 10000, 100, 100, 100, 222211, 22211, 22211, 22211, 22211, 211, 16, 17, 18, 19, 20, 21, 22, 23, 1000000, 22111111, 2111111, 21111112111111, 2111111, 2111111, 111111, 111111, 111111, 11111, 11111, 11111, 1111, 1111, 1111, 101, 30, 9, 24, 25, 26, 31, 27, 32, 33, 34, 28, 35, 29, 39, 36, 40, 37, 41, 42, 43, 38, 44, 50, 51, 52, 45, 46, 47, 48, 100000, 100001, 2211122, 211122, 10000000, 10000001,...
This seq was submitted today to the OEIS, here.
An online calculaor for such distances is there.

(Dall.e creation)




Commentaires

Posts les plus consultés de ce blog

A square for three (chess)

Le tripalin se présente

Some strings au cinéma Galeries