A330521 Lexicographically earliest sequence of distinct positive terms such that the digitsum of a(n) ends a(n+1).

1, 11, 2, 12, 3, 13, 4, 14, 5, 15, 6, 16, 7, 17, 8, 18, 9, 19, 10, 21, 23, 25, 27, 29, 111, 33, 26, 28, 110, 22, 24, 36, 39, 112, 34, 37, 210, 43, 47, 211, 44, 38, 311, 35, 48, 212, 45, 49, 113, 55, 310, 54, 59, 114, 46, 410, 65, 411, 56, 511, 57, 312, 66, 412, 67, 213, 76, 313, 77, 214, 87, 115, 97, 116, 58, 413, 68, 314

Offset: 1

Author

Carole Dubois and Eric Angelini, Mar 01 2020

Keywords

• nonn
• look
• base

Comments

This is conjectured to be a permutation of the integers > 0.

Examples

			a(1) = 1 has digitsum 1, and this 1 ends a(2) = 11;
a(2) = 11 has digitsum 2 and this 2 ends a(3) = 2;
a(3) = 2 has digitsum 2 and this 2 ends a(4) = 12;
a(4) = 12 has digitsum 3 and this 3 ends a(5) = 3;
a(5) = 3 has digitsum 3 and this 3 ends a(6) = 13;
...
a(18) = 19 has digitsum 10 and this 10 ends a(19) = 10;
a(19) = 10 has digitsum 1 and this 1 ends a(20) = 21 (as 1 and 11 are already in the sequence); etc.
		

Links

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

Crossrefs

Cf. A248025.