|
%I #12 Sep 23 2019 17:25:33
%S 1,1,2,5,14,47,174,730,3300,16361,85991,485982,2877194,18064663,
%T 118111993,810388956,5755059363,42643884970,325468477721,
%U 2576976440845,20960795772211,176056148076418,1514733658531058,13418942409623726,121442280888373117,1128425823360525506
%N 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).
%H Alois P. Heinz, <a href="/A327702/b327702.txt">Table of n, a(n) for n = 1..58</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_(number_theory)">Partition (number theory)</a>
%e a(4) = 5:
%e 4 -> 1111
%e 4 -> 211 -> 1111
%e 4 -> 31 -> 1111
%e 4 -> 31 -> 211 -> 1111
%e 4 -> 22 -> 211 -> 1111
%p v:= l-> [seq(`if`(i=1 or l[i]>l[i-1], seq(subs(1=[][], sort(
%p subsop(i=h[], l))), h=({combinat[partition](l[i])[]}
%p minus{[l[i]]})), [][]), i=1..nops(l))]:
%p b:= proc(l) option remember; `if`(max(l)<2, 1, add(b(h), h=v(l))) end:
%p a:= n-> b([n]):
%p seq(a(n), n=1..26);
%Y Cf. A002846, A327643, A327697, A327698, A327699.
%K nonn
%O 1,3
%A _Alois P. Heinz_, Sep 22 2019
|
