A383511 Number of integer partitions of n that are Look-and-Say and section-sum but not Wilf.
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 1, 0, 1, 0, 3, 3, 0, 0, 5, 2, 1, 5, 6, 1, 10, 5, 12, 11, 12, 14, 31, 15, 25, 28, 38
Offset: 0
Examples
The a(n) partitions for n = 12, 15, 20, 24, 28: (6,3,3) (6,6,3) (8,8,4) (12,6,6) (14,7,7) (6,3,3,3) (10,5,5) (6,6,6,3,3) (8,8,8,4) (8,4,4,4) (8,4,4,4,4) (8,8,4,4,4) (6,6,3,3,3,3) (8,4,4,4,4,4) (6,3,3,3,3,3,3) (10,6,6,2,2,2) (11,6,6,1,1,1,1,1)
Crossrefs
Ranking sequences are shown in parentheses below.
These partitions are ranked by (A383518).
Programs
-
Mathematica
disjointFamilies[y_]:=Select[Tuples[IntegerPartitions /@ Length/@Split[y]],UnsameQ@@Join@@#&]; conj[y_]:=If[Length[y]==0,y, Table[Length[Select[y,#>=k&]],{k,1,Max[y]}]]; Table[Length[Select[IntegerPartitions[n], disjointFamilies[#]!={}&&disjointFamilies[conj[#]]!={} && !UnsameQ@@Length/@Split[#]&]], {n,0,30}]
Comments