cp's OEIS Frontend

A332297 Number of narrowly totally strongly normal integer partitions of n.

%I A332297 #9 Jun 26 2020 06:05:46
%S A332297 1,1,2,3,2,3,3,2,2,2,3,3,2,2,3,3,2,2,2,2,2,3,2,2,2,2,2,2,3,2,3,2,2,2,
%T A332297 2,2,3,2,3,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,4,3,2,2,2,2,2,2,2,2,2,3,2,
%U A332297 2,2,2,2,2,2,2,2,2,2,3,2,2
%N A332297 Number of narrowly totally strongly normal integer partitions of n.
%C A332297 A partition is narrowly totally strongly normal if either it is empty, a singleton (narrow), or it covers an initial interval of positive integers (normal) and has weakly decreasing run-lengths (strong) that are themselves a narrowly totally strongly normal partition.
%e A332297 The a(1) = 1, a(2) = 2, a(3) = 3, and a(55) = 4 partitions:
%e A332297   (1)  (2)    (3)      (55)
%e A332297        (1,1)  (2,1)    (10,9,8,7,6,5,4,3,2,1)
%e A332297               (1,1,1)  (5,5,5,5,5,4,4,4,4,3,3,3,2,2,1)
%e A332297                        (1)^55
%e A332297 For example, starting with the partition (3,3,2,2,1) and repeatedly taking run-lengths gives (3,3,2,2,1) -> (2,2,1) -> (2,1) -> (1,1) -> (2). The first four are normal and have weakly decreasing run-lengths, and the last is a singleton, so (3,3,2,2,1) is counted under a(11).
%t A332297 tinQ[q_]:=Or[q=={},Length[q]==1,And[Union[q]==Range[Max[q]],GreaterEqual@@Length/@Split[q],tinQ[Length/@Split[q]]]];
%t A332297 Table[Length[Select[IntegerPartitions[n],tinQ]],{n,0,30}]
%Y A332297 Normal partitions are A000009.
%Y A332297 The non-totally normal version is A316496.
%Y A332297 The widely alternating version is A332292.
%Y A332297 The non-strong case of compositions is A332296.
%Y A332297 The case of compositions is A332336.
%Y A332297 The wide version is a(n) - 1 for n > 1.
%Y A332297 Cf. A001462, A025487, A100883, A181819, A182850, A317081, A317245, A317256, A317491, A332275, A332277, A332278, A332291, A332337.
%K A332297 nonn,more
%O A332297 0,3
%A A332297 _Gus Wiseman_, Feb 15 2020
%E A332297 a(60)-a(80) from _Jinyuan Wang_, Jun 26 2020