A309590 Inverse of A309589: 0-based positions in the number subsets {0, ..., 10^k - 1} written in base 10 and sorted lexicographically, for k = 1, 2, ...

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 12, 23, 34, 45, 56, 67, 78, 89, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55

Offset

0,3

Comments

The sequence is related to the flattened form of the irregular table T(k, i) described in A309589. There, the rows for k >= 1 contain a permutation of the numbers 0 <= i <= 10^k - 1 which is defined by the lexicographical order of the numbers i written in base 10.

The sequence here lists, per sorted row k, the 0-based positions of the numbers i in that row. The positions in row k are also a permutation of the numbers 0 <= i <= 10^k - 1.

Links

Table of n, a(n) for n=0..69.

Georg Fischer, Perl program which generates A309589 and this sequence.

Prog

(Perl) # cf. link

Crossrefs

Cf. A119590 (like row k=2, but i = 1..100), A190017 (like row k=4, but for i = 1..10000), A309589.

Sequence in context: A095187 A218978 A309589 * A169931 A141022 A004720

Adjacent sequences: A309587 A309588 A309589 * A309591 A309592 A309593

Keyword

nonn,base,easy,tabf

Author

Georg Fischer, Mar 02 2019

Status

approved