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).
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).
Terms
- a(0) =1a(1) =2a(2) =3a(3) =9a(4) =10a(5) =18a(6) =19a(7) =81a(8) =90a(9) =162a(10) =171a(11) =729a(12) =810a(13) =1458a(14) =1539a(15) =6561a(16) =7290a(17) =13122a(18) =13851a(19) =59049a(20) =65610a(21) =118098a(22) =124659a(23) =531441a(24) =590490a(25) =1062882a(26) =1121931a(27) =4782969a(28) =5314410a(29) =9565938
External references
- oeis: A280731