cp's OEIS Frontend

A356945 Number of multiset partitions of the prime indices of n such that each block covers an initial interval. Number of factorizations of n into members of A055932.

%I A356945 #8 Sep 10 2022 22:01:57
%S A356945 1,1,0,2,0,1,0,3,0,0,0,2,0,0,0,5,0,1,0,0,0,0,0,4,0,0,0,0,0,1,0,7,0,0,
%T A356945 0,3,0,0,0,0,0,0,0,0,0,0,0,7,0,0,0,0,0,1,0,0,0,0,0,2,0,0,0,11,0,0,0,0,
%U A356945 0,0,0,6,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A356945 Number of multiset partitions of the prime indices of n such that each block covers an initial interval. Number of factorizations of n into members of A055932.
%C A356945 A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
%H A356945 Gus Wiseman, <a href="https://docs.google.com/document/d/e/2PACX-1vR-C_picqWlu0KOguRGWaPjhS2HY7m43aGXGDcolDh4Qtyy-pu2lkq5mbHAbiMSyQoiIESG2mCGtc2j/pub">Counting and ranking classes of multiset partitions related to gapless multisets</a>
%e A356945 The a{n} multiset partitions for n = 8, 24, 72, 96:
%e A356945   {{111}}      {{1112}}      {{11122}}      {{111112}}
%e A356945   {{1}{11}}    {{1}{112}}    {{1}{1122}}    {{1}{11112}}
%e A356945   {{1}{1}{1}}  {{11}{12}}    {{11}{122}}    {{11}{1112}}
%e A356945                {{1}{1}{12}}  {{12}{112}}    {{111}{112}}
%e A356945                              {{1}{1}{122}}  {{12}{1111}}
%e A356945                              {{1}{12}{12}}  {{1}{1}{1112}}
%e A356945                                             {{1}{11}{112}}
%e A356945                                             {{11}{11}{12}}
%e A356945                                             {{1}{12}{111}}
%e A356945                                             {{1}{1}{1}{112}}
%e A356945                                             {{1}{1}{11}{12}}
%e A356945                                             {{1}{1}{1}{1}{12}}
%t A356945 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A356945 nnQ[m_]:=PrimePi/@First/@FactorInteger[m]==Range[PrimePi[Max@@First/@FactorInteger[m]]];
%t A356945 Table[Length[Select[facs[n],And@@nnQ/@#&]],{n,100}]
%Y A356945 Positions of 0's are A080259, complement A055932.
%Y A356945 A000688 counts factorizations into prime powers.
%Y A356945 A001055 counts factorizations.
%Y A356945 A001221 counts prime divisors, with sum A001414.
%Y A356945 A001222 counts prime factors with multiplicity.
%Y A356945 A056239 adds up prime indices, row sums of A112798.
%Y A356945 A356069 counts gapless divisors, initial A356224 (complement A356225).
%Y A356945 Multisets covering an initial interval are counted by A000009, A000041, A011782, ranked by A055932.
%Y A356945 Other types: A034691, A089259, A356954, A356955.
%Y A356945 Other conditions: A050320, A050330, A322585, A356233, A356931, A356936.
%Y A356945 Cf. A003963, A073491, A107742, A287170, A324929, A340852, A356234.
%K A356945 nonn
%O A356945 1,4
%A A356945 _Gus Wiseman_, Sep 08 2022