cp's OEIS Frontend

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

%I A327698 #11 Sep 23 2019 17:27:49
%S A327698 1,1,2,6,17,74,300,1755,9360,65510,442117,3802889,30213386,294892947,
%T A327698 2789021105,31360525517,334374848070,4184958056248,50606351991305,
%U A327698 704124800141153,9452367941048830,143309007303310536,2124982437997726705,35389562541842450218
%N A327698 Number of refinement sequences n -> ... -> {1}^n, where in each step exactly one part is replaced by a partition of itself into smaller parts (in weakly decreasing order).
%H A327698 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_(number_theory)">Partition (number theory)</a>
%e A327698 a(4) = 6:
%e A327698   4 -> 1111
%e A327698   4 -> 211  -> 1111
%e A327698   4 -> 31   -> 1111
%e A327698   4 -> 31   -> 211  -> 1111
%e A327698   4 -> 22   -> 112  -> 1111
%e A327698   4 -> 22   -> 211  -> 1111
%Y A327698 Cf. A002846, A327643, A327697, A327699, A327702.
%K A327698 nonn
%O A327698 1,3
%A A327698 _Alois P. Heinz_, Sep 22 2019