A278742 - cp's OEIS frontend

A278742 Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in base 10.

n	a(n)
1	1
2	2
3	3
4	10
5	11
6	12
7	20
8	30
9	100
10	110
11	200
12	300
13	1000
14	1100
15	2000
16	2100
17	3000
18	10000
19	20000
20	30000
21	100000
22	110000
23	120000
24	200000
25	300000
26	1000000
27	1100000
28	2000000
29	3000000
30	10000000
31	11000000
32	20000000
33	21000000
34	30000000
35	100000000
36	200000000
37	300000000

[1, 2, 3, 10, 11, 12, 20, 30, 100, 110, 200, 300, 1000, 1100, 2000, 2100, 3000, 10000, 20000, 30000, 100000, 110000, 120000, 200000, 300000, 1000000, 1100000, 2000000, 3000000, 10000000, 11000000, 20000000, 21000000, 30000000, 100000000, 200000000, 300000000]

cp's OEIS Frontend

A278742 Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in base 10.

Table of values

List of values