Number of refinement sequences n -> ... -> {1}^n, where in each step one part that is the rightmost copy of its size is replaced by a partition of itself into smaller parts (in weakly decreasing order).

A327702

Number of refinement sequences n -> ... -> {1}^n, where in each step one part that is the rightmost copy of its size is replaced by a partition of itself into smaller parts (in weakly decreasing order).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =5a(4) =14a(5) =47a(6) =174a(7) =730a(8) =3300a(9) =16361a(10) =85991a(11) =485982a(12) =2877194a(13) =18064663a(14) =118111993a(15) =810388956a(16) =5755059363a(17) =42643884970a(18) =325468477721

External references