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).
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).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =10a(4) =11a(5) =20a(6) =21a(7) =100a(8) =110a(9) =200a(10) =210a(11) =1000a(12) =1100a(13) =2000a(14) =2100a(15) =10000a(16) =11000a(17) =20000a(18) =21000a(19) =100000a(20) =110000a(21) =200000a(22) =210000a(23) =1000000a(24) =1100000a(25) =2000000a(26) =2100000a(27) =10000000a(28) =11000000a(29) =20000000
External references
- oeis: A281366