Lexicographically least strictly increasing sequence such that, for any n > 0, Sum_{k = 1..n} 1/a(k) can be computed without carries in factorial base.
A343522
Lexicographically least strictly increasing sequence such that, for any n > 0, Sum_{k = 1..n} 1/a(k) can be computed without carries in factorial base.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =7a(4) =45a(5) =631a(6) =399168a(7) =97044480a(8) =55794106368
External references
- oeis: A343522