A333478 Lexicographically earliest sequence of distinct positive terms such that a(n) is the number of commas that a(n) has to step over (to the right) in order to find an integer embedding the substring a(n).

1, 10, 2, 3, 12, 4, 13, 5, 6, 14, 7, 100, 15, 8, 16, 9, 112, 17, 11, 113, 18, 28, 19, 114, 29, 20, 21, 115, 22, 110, 116, 23, 24, 25, 117, 26, 27, 30, 118, 31, 32, 119, 33, 34, 35, 120, 36, 121, 37, 128, 122, 38, 39, 129, 223, 40, 124, 41, 125, 42, 43, 126, 44, 127, 45, 47, 48, 130, 49, 46, 131, 50, 132, 51

Offset

1,2

Comments

The integer embedding the substring k might not be the closest one to a(n). Example is given by a(14) = 8 = k. We see that a(8), stepping (to the right) over 8 commas, meets a(22) = 28, which is correct. But a(21) = 18 embeds also the substring 8. We don't mind that.

Links

Carole Dubois, Table of n, a(n) for n = 1..5000

Example

a(1) = 1 steps over 1 comma and finds a(2) = 10 which embeds the substring 1;
a(2) = 10 steps over 10 commas and finds a(12) = 100 which embeds the substring 10;
a(3) = 2 steps over 2 commas and finds a(5) = 12 which embeds the substring 2;
a(4) = 3 steps over 3 commas and finds a(7) = 13 which embeds the substring 3; etc.

Crossrefs

Sequence in context: A323421 A306321 A160136 * A336954 A322467 A342078

Adjacent sequences: A333475 A333476 A333477 * A333479 A333480 A333481

Keyword

base,nonn

Author

Eric Angelini and Carole Dubois, Mar 23 2020

Status

approved