A351293 Number of non-Look-and-Say partitions of n. Number of integer partitions of n such that there is no way to choose a disjoint strict integer partition of each multiplicity.
0, 0, 0, 1, 1, 2, 4, 5, 9, 14, 21, 28, 44, 56, 80, 111, 148, 192, 264, 335, 447, 575, 743, 937, 1213, 1513, 1924, 2396, 3011, 3715, 4646, 5687, 7040, 8600, 10556, 12804, 15650, 18897, 22930, 27593, 33296, 39884, 47921, 57168, 68360, 81295, 96807, 114685
Offset: 0
Keywords
Examples
The a(3) = 1 through a(9) = 14 partitions: (21) (31) (32) (42) (43) (53) (54) (41) (51) (52) (62) (63) (321) (61) (71) (72) (2211) (421) (431) (81) (3211) (521) (432) (3221) (531) (3311) (621) (4211) (3321) (32111) (4221) (4311) (5211) (32211) (42111) (321111)
Crossrefs
These partitions appear to be ranked by A351295.
Non-Wilf partitions in the complement are counted by A351592.
A032020 = number of binary expansions with all distinct run-lengths.
A044813 = numbers whose binary expansion has all distinct run-lengths.
A181819 = Heinz number of the prime signature of n (prime shadow).
A329738 = compositions with all equal run-lengths.
Programs
-
Mathematica
disjointFamilies[y_]:=Select[Tuples[IntegerPartitions/@Length/@Split[y]],UnsameQ@@Join@@#&]; Table[Length[Select[IntegerPartitions[n],Length[disjointFamilies[#]]==0&]],{n,0,15}] (* Gus Wiseman, Aug 13 2025 *)
Extensions
Edited by Gus Wiseman, Aug 12 2025
Comments