A336611 - cp's OEIS frontend

A336611 Always start on the lowest digit of a(n), then visit all digits of a(n) in increasing order. The terms of the sequence are the smallest one that force the visitor to walk n steps to complete his tour (a single step drives you from a digit to the closest one).

n	a(n)
1	10
2	100
3	101
4	1011
5	1001
6	1320
7	1302
8	10210
9	10201
10	13002
11	13042
12	102013
13	102031
14	130024
15	130042
16	135204
17	135024
18	1024013
19	1035024
20	1305204
21	1305024
22	1350024
23	1350624
24	10240513
25	10350624
26	13050024
27	13050624
28	13500264
29	13500624
30	13572046
31	13570246
32	103572046
33	103570246
34	130572046
35	130570246
36	135072046

[10, 100, 101, 1011, 1001, 1320, 1302, 10210, 10201, 13002, 13042, 102013, 102031, 130024, 130042, 135204, 135024, 1024013, 1035024, 1305204, 1305024, 1350024, 1350624, 10240513, 10350624, 13050024, 13050624, 13500264, 13500624, 13572046, 13570246, 103572046, 103570246, 130572046, 130570246, 135072046]

cp's OEIS Frontend

A336611 Always start on the lowest digit of a(n), then visit all digits of a(n) in increasing order. The terms of the sequence are the smallest one that force the visitor to walk n steps to complete his tour (a single step drives you from a digit to the closest one).

Table of values

List of values