A367638 - cp's OEIS frontend

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.

n	a(n)
1	1
2	2
3	10
4	11
5	11
6	12
7	13
8	3
9	4
10	5
11	14
12	15
13	200
14	6
15	1000
16	22111
17	2111
18	7
19	8
20	10000
21	100
22	100
23	100
24	222211
25	22211
26	22211
27	22211
28	22211
29	211
30	16
31	17
32	18
33	19
34	20
35	21
36	22
37	23
38	1000000
39	22111111
40	2111111
41	2111111
42	2111111
43	2111111
44	2111111
45	111111
46	111111
47	111111
48	11111
49	11111
50	11111
51	1111
52	1111
53	1111
54	101
55	30
56	9
57	24

[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, 2111111, 2111111, 2111111, 2111111, 111111, 111111, 111111, 11111, 11111, 11111, 1111, 1111, 1111, 101, 30, 9, 24]

cp's OEIS Frontend

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.

Table of values

List of values