Number of refinement sequences n -> ... -> {1}^n, where in each step every single part of a nonempty selection of parts is replaced by a partition of itself into two smaller parts (in weakly decreasing order).
A327699
Number of refinement sequences n -> ... -> {1}^n, where in each step every single part of a nonempty selection of parts is replaced by a partition of itself into two smaller parts (in weakly decreasing order).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =9a(5) =48a(6) =211a(7) =1736a(8) =9777a(9) =91169a(10) =739174a(11) =8613817a(12) =83763730a(13) =1105436491a(14) =13222076337a(15) =207852246589
External references
- oeis: A327699