A367810 - cp's OEIS frontend

A367810 Lexicographically earliest sequence of distinct positive terms not ending in 0 such that the Levenshtein distance (Ld) between a(n) and a(n+1) is equal to the last digit of a(n).

n	a(n)
1	1
2	2
3	11
4	12
5	3
6	101
7	102
8	13
9	201
10	21
11	22
12	4
13	1001
14	1002
15	103
16	5
17	10001
18	10002
19	1003
20	14
21	2001
22	2002
23	203
24	6
25	100001
26	100002
27	10003
28	104
29	2211
30	211
31	111
32	112
33	15
34	20001
35	20002
36	202
37	23
38	105
39	22211
40	2221
41	221
42	121
43	122
44	16
45	200001
46	200002
47	20003
48	204
49	1111
50	1011
51	1012
52	106
53	222211
54	22221
55	2222
56	212
57	17

[1, 2, 11, 12, 3, 101, 102, 13, 201, 21, 22, 4, 1001, 1002, 103, 5, 10001, 10002, 1003, 14, 2001, 2002, 203, 6, 100001, 100002, 10003, 104, 2211, 211, 111, 112, 15, 20001, 20002, 202, 23, 105, 22211, 2221, 221, 121, 122, 16, 200001, 200002, 20003, 204, 1111, 1011, 1012, 106, 222211, 22221, 2222, 212, 17]

cp's OEIS Frontend

A367810 Lexicographically earliest sequence of distinct positive terms not ending in 0 such that the Levenshtein distance (Ld) between a(n) and a(n+1) is equal to the last digit of a(n).

Table of values

List of values