A281366 - cp's OEIS frontend

A281366 Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in base 9 (the numbers are written in base 9).

n	a(n)
1	1
2	2
3	3
4	10
5	11
6	20
7	21
8	100
9	110
10	200
11	210
12	1000
13	1100
14	2000
15	2100
16	10000
17	11000
18	20000
19	21000
20	100000
21	110000
22	200000
23	210000
24	1000000
25	1100000
26	2000000
27	2100000
28	10000000
29	11000000
30	20000000
31	21000000
32	100000000
33	110000000
34	200000000
35	210000000

[1, 2, 3, 10, 11, 20, 21, 100, 110, 200, 210, 1000, 1100, 2000, 2100, 10000, 11000, 20000, 21000, 100000, 110000, 200000, 210000, 1000000, 1100000, 2000000, 2100000, 10000000, 11000000, 20000000, 21000000, 100000000, 110000000, 200000000, 210000000]

cp's OEIS Frontend

A281366 Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in base 9 (the numbers are written in base 9).

Table of values

List of values