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 smaller parts (in weakly decreasing order).

A327697

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 smaller parts (in weakly decreasing order).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =7a(4) =22a(5) =122a(6) =598a(7) =4683a(8) =31148a(9) =292008a(10) =2560274a(11) =30122014a(12) =313694962a(13) =4189079688a(14) =53048837390a(15) =826150653479

External references