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

A279732

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

Terms

    a(0) =1a(1) =2a(2) =6a(3) =8a(4) =24a(5) =30a(6) =48a(7) =120a(8) =240a(9) =720a(10) =840a(11) =1440a(12) =1560a(13) =5040a(14) =10080a(15) =15120a(16) =40320a(17) =45360a(18) =80640a(19) =120960a(20) =362880a(21) =403200a(22) =725760a(23) =1088640a(24) =3628800a(25) =3991680a(26) =7257600a(27) =7620480a(28) =10886400a(29) =39916800

External references