Sequence S of positive integers 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.
A367638
Sequence S of positive integers 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.
Terms
- a(0) =1a(1) =2a(2) =10a(3) =11a(4) =11a(5) =12a(6) =13a(7) =3a(8) =4a(9) =5a(10) =14a(11) =15a(12) =200a(13) =6a(14) =1000a(15) =22111a(16) =2111a(17) =7a(18) =8a(19) =10000a(20) =100a(21) =100a(22) =100a(23) =222211a(24) =22211a(25) =22211a(26) =22211a(27) =22211a(28) =211a(29) =16
External references
- oeis: A367638