Hyperplane-counting upper bound on the number of sorted orders of X+Y for two lists X and Y of length n.
A343245
Hyperplane-counting upper bound on the number of sorted orders of X+Y for two lists X and Y of length n.
Terms
- a(0) =1a(1) =1a(2) =16a(3) =190051a(4) =48563893286
External references
- oeis: A343245