cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A317755 Number of multiset partitions of strongly normal multisets of size n such that the blocks have empty intersection.

This page as a plain text file.
%I A317755 #10 May 09 2021 02:47:46
%S A317755 0,1,6,30,130,629,2930,15019,78224,438626,2548481
%N A317755 Number of multiset partitions of strongly normal multisets of size n such that the blocks have empty intersection.
%C A317755 A multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities.
%e A317755 The a(3) = 6 strongly normal multiset partitions with empty intersection:
%e A317755   {{2},{1,1}}
%e A317755   {{1},{2,3}}
%e A317755   {{2},{1,3}}
%e A317755   {{3},{1,2}}
%e A317755   {{1},{1},{2}}
%e A317755   {{1},{2},{3}}
%t A317755 sps[{}]:={{}};sps[set:{i_,___}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,___}];
%t A317755 mps[set_]:=Union[Sort[Sort/@(#/.x_Integer:>set[[x]])]&/@sps[Range[Length[set]]]];
%t A317755 strnorm[n_]:=Flatten[MapIndexed[Table[#2,{#1}]&,#]]&/@IntegerPartitions[n];
%t A317755 Table[Length[Join@@Table[Select[mps[m],Intersection@@#=={}&],{m,strnorm[n]}]],{n,6}]
%Y A317755 Cf. A007716, A035310, A255906, A317073, A281116, A317077, A317078, A317532, A317533.
%Y A317755 Cf. A317748, A317751, A317752, A317757, A317775.
%K A317755 nonn,more
%O A317755 1,3
%A A317755 _Gus Wiseman_, Aug 06 2018
%E A317755 a(10)-a(11) from _Robert Price_, May 08 2021