A280731 - cp's OEIS frontend

A280731 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 10).

n	a(n)
1	1
2	2
3	3
4	9
5	10
6	18
7	19
8	81
9	90
10	162
11	171
12	729
13	810
14	1458
15	1539
16	6561
17	7290
18	13122
19	13851
20	59049
21	65610
22	118098
23	124659
24	531441
25	590490
26	1062882
27	1121931
28	4782969
29	5314410
30	9565938
31	10097379
32	43046721
33	47829690
34	86093442
35	90876411
36	387420489
37	430467210

[1, 2, 3, 9, 10, 18, 19, 81, 90, 162, 171, 729, 810, 1458, 1539, 6561, 7290, 13122, 13851, 59049, 65610, 118098, 124659, 531441, 590490, 1062882, 1121931, 4782969, 5314410, 9565938, 10097379, 43046721, 47829690, 86093442, 90876411, 387420489, 430467210]

cp's OEIS Frontend

A280731 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 10).

Table of values

List of values